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.

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.

High Speed FPGA Implementation of Cryptographic KECCAK Hash Function Crypto-Processor

2016 ◽  
Vol 25 (04) ◽  
pp. 1650026 ◽  
Author(s):  
Fatma Kahri ◽  
Hassen Mestiri ◽  
Belgacem Bouallegue ◽  
Mohsen Machhout
Keyword(s):  
Hash Function ◽  
High Speed ◽  
Hash Functions ◽  
Message Authentication ◽  
Authentication Codes ◽  
Trade Off ◽  
Security Applications ◽  
Hash Algorithm ◽  
The Us ◽  
Cryptographic Hash Functions

Cryptographic hash functions are at the heart of many information security applications like message authentication codes (MACs), digital signatures and other forms of authentication. One of the methods to ensure information integrity is the use of hash functions, which generates a stream of bytes (hash) that must be unique. But most functions can no longer prevent malicious attacks and ensure that the information have just a hash. Because of the weakening of the widely used SHA-1 hash algorithm and concerns over the similarly-structured algorithms of the SHA-2 family, the US National Institute of Standards and Technology (NIST) has initiated the SHA-3 contest in order to select a suitable drop-in replacement. KECCAK hash function has been submitted to SHA-3 competition and it belongs to the final five candidate functions. In this paper, we present the implementation details of the hash function’s KECCAK algorithm, moreover, the proposed KECCAK design has been implemented on XILINX FPGAs. Its area, frequency, throughput and efficiency have been derived and compared and it is shown that the proposed design allows a trade-off between the maximum frequency and the area implementation.

Schemes for Digital Signatures

2012 ◽  
pp. 20-25
Keyword(s):  
Hash Functions ◽  
Digital Signatures ◽  
The Other ◽  
Bulletin Board ◽  
Message Authentication ◽  
Authentication Codes ◽  
The Public ◽  
Message Authentication Codes ◽  
Other Hand

Integrity is the property of information concerning protection against its unauthorized modifications and forgeries. This chapter discusses bulletin board (BB), hash functions, MACs (Message Authentication Codes) and digital signatures, as schemes for maintaining integrity of data. BBs protect data by simply disclosing them to the public, i.e. an entity cannot modify them without being watched by others. Hash functions, Macs, and digital signatures protect data by detecting illegitimate modifications while attaching values to the data. Namely, when an entity illegitimately modifies the data, the modified results become inconsistent with the attached values. When hash functions, MACs and digital signatures are compared regarding the ability to convince entities that the data are authorized ones, hash functions cannot enable entities to convince others, and by MACs, entities can convince others only when relevant secrets are properly protected. On the other hand, digital signatures enable anyone to convince others without constraints.

scholarly journals Hash Algorithm In Verification Of Certificate Data Integrity And Security

2021 ◽  
Vol 3 (2) ◽  
pp. 65-72
Author(s):  
Muhammad Rehan Anwar ◽  
Desy Apriani ◽  
Irsa Rizkita Adianita
Keyword(s):  
Hash Function ◽  
Data Integrity ◽  
Message Authentication ◽  
Authentication Codes ◽  
Arbitrary Length ◽  
Security Applications ◽  
Hash Algorithm ◽  
Cryptographic Primitive ◽  
One Way Function ◽  
Cryptographic Hash Functions

The hash function is the most important cryptographic primitive function and is an integral part of the blockchain data structure. Hashes are often used in cryptographic protocols, information security applications such as Digital Signatures and message authentication codes (MACs). In the current development of certificate data security, there are 2 (two) types of hashes that are widely applied, namely, MD and SHA. However, when it comes to efficiency, in this study the hash type SHA-256 is used because it can be calculated faster with a better level of security. In the hypothesis, the Merkle-Damgård construction method is also proposed to support data integrity verification. Moreover, a cryptographic hash function is a one-way function that converts input data of arbitrary length and produces output of a fixed length so that it can be used to securely authenticate users without storing passwords locally. Since basically, cryptographic hash functions have many different uses in various situations, this research resulted in the use of hash algorithms in verifying the integrity and authenticity of certificate information.

scholarly journals Information-Theoretically Secure Data Origin Authentication with Quantum and Classical Resources

Cryptography ◽  
2020 ◽  
Vol 4 (4) ◽  
pp. 31
Author(s):  
Georgios M. Nikolopoulos ◽  
Marc Fischlin
Keyword(s):  
Broad Class ◽  
Hash Functions ◽  
Message Authentication ◽  
Secret Key ◽  
Authentication Codes ◽  
Message Authentication Codes ◽  
Secure Data ◽  
Authentication Schemes ◽  
Better Than

In conventional cryptography, information-theoretically secure message authentication can be achieved by means of universal hash functions, and requires that the two legitimate users share a random secret key, which is at least twice as long as the tag. We address the question of whether quantum resources can offer any advantage over classical unconditionally secure message authentication codes. It is shown that a broad class of symmetric prepare-and-measure quantum message-authentication schemes cannot do better than their classical counterparts.

Digital Image Protection using Keyed Hash Function

2012 ◽  
Vol 2 (2) ◽  
pp. 36-47 ◽  
Author(s):  
Siva Charan Muraharirao ◽  
Manik Lal Das
Keyword(s):  
Digital Image ◽  
Digital Signature ◽  
Hash Function ◽  
Image Authentication ◽  
Experimental Results ◽  
Public Key ◽  
Message Authentication ◽  
Authentication Codes ◽  
Message Authentication Codes ◽  
Image Protection

Digital image authentication is an essential attribute for protecting digital image from piracy and copyright violator. Anti-piracy, digital watermarking, and ownership verification are some mechanisms evolving over the years for achieving digital image authentication. Cryptographic primitives, such as hash function, digital signature, and message authentication codes are being used in several applications including digital image authentication. Use of Least Significant Bit (LSB) is one of the classical approaches for digital image authentication. Although LSB approach is efficient, it does not provide adequate security services. On the other hand, digital signature-based image authentication provides better security, but with added computational cost in comparison with LSB approach. Furthermore, digital signature-based authentication approach requires managing public key infrastructure. Considering security weakness of LSB-based approach and cost overhead of public key based approach, the authors present a digital image authentication scheme using LSB and message authentication codes (MAC). The MAC-based approach for authenticating digital image is secure and efficient approach without public key management overhead. The authors also provide experimental results of the proposed scheme using MATLAB. The experimental results show that the proposed scheme is efficient and secure in comparisons with other schemes.

scholarly journals ZMAC+ – An Efficient Variable-output-length Variant of ZMAC

2017 ◽  
pp. 306-325 ◽  
Author(s):  
Eik List ◽  
Mridul Nandi
Keyword(s):  
Hash Function ◽  
Block Ciphers ◽  
Message Authentication ◽  
Authentication Codes ◽  
Message Authentication Codes ◽  
Length Variant ◽  
Symmetric Key ◽  
Security Bound

There is an ongoing trend in the symmetric-key cryptographic community to construct highly secure modes and message authentication codes based on tweakable block ciphers (TBCs). Recent constructions, such as Cogliati et al.’s HaT or Iwata et al.’s ZMAC, employ both the n-bit plaintext and the t-bit tweak simultaneously for higher performance. This work revisits ZMAC, and proposes a simpler alternative finalization based on HaT. As a result, we propose HtTBC, and call its instantiation with ZHash as a hash function ZMAC+. Compared to HaT, ZMAC+ (1) requires only a single key and a single primitive. Compared to ZMAC, our construction (2) allows variable, per-query parametrizable output lengths. Moreover, ZMAC+ (3) avoids the complex finalization of ZMAC and (4) improves the security bound from Ο(σ2/2n+min(n,t)) to Ο(q/2n + q(q + σ)/2n+min(n,t)) while retaining a practical tweak space.

Sign in / Sign up

Export Citation Format

Share Document