Differential properties of authenticated encryption mode based on universal hash function (XTSMAC)

2021 ◽  
Author(s):  
Alexey Nesterenko
Keyword(s):  
Hash Function ◽  
Authenticated Encryption ◽  
Universal Hash Function ◽  
Differential Properties

scholarly journals The Definition and Software Performance of Hashstream, a Fast Length-Flexible PRF

Cryptography ◽  
2018 ◽  
Vol 2 (4) ◽  
pp. 31 ◽  
Author(s):  
Ted Krovetz
Keyword(s):  
Hash Function ◽  
Provable Security ◽  
Stream Cipher ◽  
Software Performance ◽  
Authenticated Encryption ◽  
Random Generation ◽  
Process Data ◽  
Straightforward Manner ◽  
Caesar Competition ◽  
Universal Hash Function

Two of the fastest types of cryptographic algorithms are the stream cipher and the almost-universal hash function. There are secure examples of each that process data in software using less than one CPU cycle per byte. Hashstream combines the two types of algorithms in a straightforward manner yielding a PRF that can both consume inputs of and produce pseudorandom outputs of any desired length. The result is an object useful in many contexts: authentication, encryption, authenticated encryption, random generation, mask generation, etc. The HS1-SIV authenticated-encryption algorithm—a CAESAR competition second round selection—was based on Hashstream and showed the promise of such an approach by having provable security and topping the speed charts in several test configurations.

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.

Everlasting security of quantum key distribution with 1K-DWCDM and quadratic hash

2021 ◽  
Vol 21 (3&4) ◽  
pp. 0181-0202
Author(s):  
Khodakhast Bibak ◽  
Robert Ritchie ◽  
Behrouz Zolfaghari
Keyword(s):  
Hash Function ◽  
Quantum Key Distribution ◽  
Key Distribution ◽  
Privacy Amplification ◽  
Universal Hashing ◽  
Wide Range ◽  
Strong Property ◽  
Everlasting Security ◽  
Universal Hash Function ◽  
General Method

Quantum key distribution (QKD) offers a very strong property called everlasting security, which says if authentication is unbroken during the execution of QKD, the generated key remains information-theoretically secure indefinitely. For this purpose, we propose the use of certain universal hashing based MACs for use in QKD, which are fast, very efficient with key material, and are shown to be highly secure. Universal hash functions are ubiquitous in computer science with many applications ranging from quantum key distribution and information security to data structures and parallel computing. In QKD, they are used at least for authentication, error correction, and privacy amplification. Using results from Cohen [Duke Math. J., 1954], we also construct some new families of $\varepsilon$-almost-$\Delta$-universal hash function families which have much better collision bounds than the well-known Polynomial Hash. Then we propose a general method for converting any such family to an $\varepsilon$-almost-strongly universal hash function family, which makes them useful in a wide range of applications, including authentication in QKD.

Hash Functions and Their Applications

2018 ◽  
pp. 66-77
Author(s):  
Kannan Balasubramanian
Keyword(s):  
Hash Function ◽  
Hash Functions ◽  
Digital Signatures ◽  
Message Authentication ◽  
Authenticated Encryption ◽  
Authentication Codes ◽  
Message Authentication Codes ◽  
Message Digest ◽  
Cryptographic Hash Functions

Cryptographic Hash Functions are used to achieve a number of Security goals like Message Authentication, Message Integrity, and are also used to implement Digital Signatures (Non-repudiation), and Entity Authentication. This chapter discusses the construction of hash functions and the various attacks on the Hash functions. The Message Authentication Codes are similar to the Hash functions except that they require a key for producing the message digest or hash. Authenticated Encryption is a scheme that combines hashing and Encryption. The Various types of hash functions like one-way hash function, Collision Resistant hash function and Universal hash functions are also discussed in this chapter.

Pseudorandom Generators Based on One-Way Functions

2014 ◽  
Vol 577 ◽  
pp. 820-823
Author(s):  
Shu Jing Gao ◽  
Ting Qiang Song ◽  
Wei Zhang
Keyword(s):  
Hash Function ◽  
Pseudorandom Generator ◽  
Pseudorandom Generators ◽  
Output Sequence ◽  
Universal Hash Function ◽  
The One ◽  
One Way Function ◽  
Important Notion

Pseudorandom Generators is an important notion of cryptography. A new randomized iterating method of one-way function is proposed, after the analyzing of current research on pseudorandom generators based on one-way function. On the basis of this randomized iteration, a pseudorandom generator with linear seeds length is constructed using general regular one-way function and universal hash function. The output sequence of the proposed PRNG is unpredictable and the length of the seeds is linear to the input length of the one-way function.

scholarly journals Ascon v1.2: Lightweight Authenticated Encryption and Hashing

2021 ◽  
Vol 34 (3) ◽  
Author(s):  
Christoph Dobraunig ◽  
Maria Eichlseder ◽  
Florian Mendel ◽  
Martin Schläffer
Keyword(s):  
Hash Function ◽  
Information Infrastructure ◽  
Output Function ◽  
Authenticated Encryption ◽  
Resource Constrained ◽  
Caesar Competition ◽  
Encryption Algorithms ◽  
Basic Need ◽  
Resource Constrained Devices ◽  
Constrained Devices

AbstractAuthenticated encryption satisfies the basic need for authenticity and confidentiality in our information infrastructure. In this paper, we provide the specification of Ascon-128 and Ascon-128a. Both authenticated encryption algorithms provide efficient authenticated encryption on resource-constrained devices and on high-end CPUs. Furthermore, they have been selected as the “primary choice” for lightweight authenticated encryption in the final portfolio of the CAESAR competition. In addition, we specify the hash function Ascon-Hash, and the extendable output function Ascon-Xof. Moreover, we complement the specification by providing a detailed overview of existing cryptanalysis and implementation results.

Sign in / Sign up

Export Citation Format

Share Document