Universal hashing and authentication codes

1994 ◽  
Vol 4 (3) ◽  
pp. 369-380 ◽  
Author(s):  
D. R. Stinson
Keyword(s):  
Authentication Codes ◽  
Universal Hashing

scholarly journals Research of collision properties of the modified UMAC algorithm on crypto-code constructions

2022 ◽  
pp. 34-43
Author(s):  
Serhii Yevseiev ◽  
Alla Havrylova ◽  
Olha Korol ◽  
Oleh Dmitriiev ◽  
Oleksii Nesmiian ◽  
...  
Keyword(s):  
Authentication Codes ◽  
Advantages And Disadvantages ◽  
Universal Hashing ◽  
Practical Research ◽  
Hash Code ◽  
Last Stage ◽  
Code Constructions ◽  
Transfer Of Information ◽  
The Impact ◽  
Hash Codes

The transfer of information by telecommunication channels is accompanied by message hashing to control the integrity of the data and confirm the authenticity of the data. When using a reliable hash function, it is computationally difficult to create a fake message with a pre-existing hash code, however, due to the weaknesses of specific hashing algorithms, this threat can be feasible. To increase the level of cryptographic strength of transmitted messages over telecommunication channels, there are ways to create hash codes, which, according to practical research, are imperfect in terms of the speed of their formation and the degree of cryptographic strength. The collisional properties of hashing functions formed using the modified UMAC algorithm using the methodology for assessing the universality and strict universality of hash codes are investigated. Based on the results of the research, an assessment of the impact of the proposed modifications at the last stage of the generation of authentication codes on the provision of universal hashing properties was presented. The analysis of the advantages and disadvantages that accompany the formation of the hash code by the previously known methods is carried out. The scheme of cascading generation of data integrity and authenticity control codes using the UMAC algorithm on crypto-code constructions has been improved. Schemes of algorithms for checking hash codes were developed to meet the requirements of universality and strict universality. The calculation and analysis of collision search in the set of generated hash codes was carried out according to the requirements of a universal and strictly universal class for creating hash codes

Data Integrity

2017 ◽  
Author(s):  
Keith M. Martin
Keyword(s):  
Hash Function ◽  
Hash Functions ◽  
Data Integrity ◽  
Message Authentication ◽  
Authenticated Encryption ◽  
Authentication Codes ◽  
Basic Model ◽  
Function Design ◽  
Security Properties ◽  
Different Levels

This chapter discusses cryptographic mechanisms for providing data integrity. We begin by identifying different levels of data integrity that can be provided. We then look in detail at hash functions, explaining the different security properties that they have, as well as presenting several different applications of a hash function. We then look at hash function design and illustrate this by discussing the hash function SHA-3. Next, we discuss message authentication codes (MACs), presenting a basic model and discussing basic properties. We compare two different MAC constructions, CBC-MAC and HMAC. Finally, we consider different ways of using MACs together with encryption. We focus on authenticated encryption modes, and illustrate these by describing Galois Counter mode.

Sign in / Sign up

Export Citation Format

Share Document