Corpus ID: 7708449

Modern Hash Function Construction

  title={Modern Hash Function Construction},
  author={Benjamin Denton and Reza R. Adhami},
This paper discusses modern hash function construction using the NIST SHA-3 competition as a survey of modern hash function construction properties. Three primary hash function designs are identified based on the designs of SHA-3 candidates submitted as part of the NIST SHA-3 competition. These designs are Widepipe, Sponge, and HAsh Iterated FrAmework (HAIFA). Keywordscryptography; hashing; hash function 
1 Citations

Figures and Tables from this paper

Light-weight hashing method for user authentication in Internet-of-Things
A customized BLAKE2b hashing algorithm with modified elliptic curve digital signature scheme (ECDSA) is proposed to provide an energy efficient authentication method that is resistant to Man-in-the-Middle attack, Distributed DoS attack, pre-image resistance, second pre- image resistance and collision resistance. Expand


Design Principles for Iterated Hash Functions
  • S. Lucks
  • Computer Science, Mathematics
  • IACR Cryptol. ePrint Arch.
  • 2004
In a formal model, modifications to the size of the internal state of an n-bit hash function to w > n bit quantifiably improve the security of iterated hash functions against generic attacks. Expand
Finding Collisions in the Full SHA-1
This is the first attack on the full 80-step SHA-1 with complexity less than the 280 theoretical bound, and it is shown that collisions ofSHA-1 can be found with complexityLess than 269 hash operations. Expand
One Way Hash Functions and DES
This work shows three one-way hash functions which are secure if DES is a good random block cipher. Expand
A Framework for Iterative Hash Functions - HAIFA
It is shown that most recent pro- posals such as randomized hashing, the enveloped Merkle-Damgard, and the RMC and ROX modes can be all be instantiated as part of the HAsh Iterative FrAmework (HAIFA). Expand
Security Reductions of the Second Round SHA-3 Candidates
Surprisingly, some security bounds from the literature are derived, which the hash function designers seem to be unaware of, and this generalizes the well-known proof of collision resistance preservation, such that all SHA-3 candidates with a suffix-free padding are covered. Expand
Sponge Functions
A good cryptographic hash function should behave like a random oracle: it should not have weaknesses that a random oracle does not have. Due to the existence of inner collisions, iterated hashExpand
Second Preimages on n-bit Hash Functions for Much Less than 2n Work
An algorithm for finding expandable messages for any n-bit hash function built using the Damgard-Merkle construction, which requires only a small multiple of the work done to find a single collision in the hash function. Expand
Herding Hash Functions and the Nostradamus Attack
In this paper, we develop a new attack on Damgard-Merkle hash functions, called the herding attack, in which an attacker who can find many collisions on the hash function by brute force can firstExpand
Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions
It is shown that finding multicollisions, i.e. r-tuples of messages that all hash to the same value, is not much harder than finding ordinary collisions, even for extremely large values of r, and it is proved that concatenating the results of several iterated hash functions in order to build a larger one does not yield a secure construction. Expand
Random oracles are practical: a paradigm for designing efficient protocols
It is argued that the random oracles model—where all parties have access to a public random oracle—provides a bridge between cryptographic theory and cryptographic practice, and yields protocols much more efficient than standard ones while retaining many of the advantages of provable security. Expand