Hash Functions

Overviews
- Open Research Areas in Symmetric Cryptography and Technical Trends in Lightweight Cryptography (ECRYPT report, 2005)
- Ongoing Research Areas in Symmetric Cryptography (ECRYPT reprot, 2006)
Competition for SHA-3
- Cryptographic Hash Algorithm Competition (Page @ NIST)
- First round submissions (Page @ NIST)
- The SHA-3 Zoo (The ECRYPT Hash Function Website)
- eBASH - benchmarking (DJ Bernstein)
Standards
- Secure Hash Standard (FIPS 180-1)
- HAS-160 (Korean Hash Algorithm Standard)
- SHA (NIST page)
  - FIPS 180-2 (05.09.02)
  - Comments to FIPS 180-2 (05.09.02)
- SHA-2 (SHA-256, SHA-384, SHA-512)
  - Source code
    - SHA-256, SHA-384, and SHA-512, C
      (Aaron Gifforf, BSD license)
- Internet drafts
  - Strengthening Digital Signatures via Randomized Hashing (Halevi, Krawczyk, 2005)
Concrete Hash Functions
- @MD5 and family
- HASH127 (D Bernstein)
- MMH: Message Authentication in Software in the Gbit/second Rates (Shai Halevi and Hugo Krawczyk)
- Tiger []
  - Tiger's Homepage
- FFT-Hash
  - The Black-Box Model for Cryptographic Primitives (Claus Peter Schnorr, Serge Vaudenay, JoC 1998)
- Provable secure hash functions
  - Collision-Free Hashing from Lattice Problems (Oded Goldreich, Shafi Goldwasser and Shai Halevi, 1996)
  - Generalized Compact Knapsacks are Collision Resistant (Vadim Lyubashevsky, Daniele Micciancio, ECCC TR05-142)
  - Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices (Chris Peikert, Alon Rosen, ECCC TR05-158)
Unclassified papers
- On Collisions of Hash Functions Turbo SHA-2 (Vlastimil Klima, eprint 2008/003)
- Efficient Tweakable Enciphering Schemes from (Block-Wise) Universal Hash Functions (Palash Sarkar, eprint 2008/004)
- The Encrypted Elliptic Curve Hash (Daniel R. L. Brown, eprint 2008/012)
- Computing Almost Exact Probabilities of Differential Hash Collision Paths by Applying Appropriate Stochastic Methods (M. Gebhardt and G. Illies and W. Schindler, eprint 2008/022)
- Cryptanalysis of CRUSH hash structure (Nasour Bagheri, Majid Naderi, Babak Sadeghiyan, eprint 2008/043)
- Another Glance At Blockcipher Based Hashing (Martijn Stam, eprint 2008/071)
- On the Strength of the Concatenated Hash Combiner when All the Hash Functions are Weak (Jonathan J. Hoch and Adi Shamir, eprint 2008/075)
- Improving upon HCTR and matching attacks for Hash-Counter-Hash approach (Mridul Nandi, eprint 2008/090)
- On the Design of Secure and Fast Double Block Length Hash Functions (Zheng Gong and Xuejia Lai and Kefei Chen, eprint 2008/110)
- Full Cryptanalysis of LPS and Morgenstern Hash Function (Christophe Petit and Kristin Lauter and Jean-Jacques Quisquater, eprint 2008/173)
- Non-Linear Reduced Round Attacks Against SHA-2 Hash family (Somitra Kumar Sanadhya and Palash Sarkar, eprint 2008/174)
- How to Build a Hash Function from any Collision-Resistant Function (Thomas Ristenpart and Thomas Shrimpton, eprint 2008/189)
- A New Universal Hash Function and Other Cryptographic Algorithms Suitable for Resource Constrained Devices (Palash Sarkar, eprint 2008/216)
- Slide Attacks on a Class of Hash Functions (Michael Gorski and Stefan Lucks and Thomas Peyrin, eprint 2008/263)
- Higher Order Differential Cryptanalysis of Multivariate Hash Functions (Yiyuan Luo, Xuejia Lai, eprint 2008/350)
- History-Independent Cuckoo Hashing (Moni Naor and Gil Segev and Udi Wieder, eprint 2008/358)
- Hash Functions from Sigma Protocols and Improvements to VSH (Mihir Bellare and Todor Ristov, eprint 2008/379)
- Indifferentiable Security Analysis of choppfMD, chopMD, a chopMDP, chopWPH, chopNI, chopEMD, chopCS, and chopESh Hash Domain Extensions (Donghoon Chang and Jaechul Sung and Seokhie Hong and Sangjin Lee, eprint 2008/407)
- New hash function designs (Igor Semaev, eprint 2008/455)
- Various Security Analysis of a pfCM-MD Hash Domain Extension and Applications based on the Extension (Donghoon Chang and Seokhie Hong and Jaechul Sung and Sangjin Lee, eprint 2008/460)
- Vortex: A New Family of One Way Hash Functions based on Rijndael Rounds and Carry-less Multiplication (Michael Kounavis and Shay Gueron, eprint 2008/464)
Cryptanalysis
Theory
- Sufficient Conditions for Collision-Resistant Hashing (Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, TCC 2005)
- Composition principles
  - Merkle-Damgaard
  - Domain Extender for Collision Resistant Hash Functions: Improving Upon Merkle-Damgaard Iteration (Palash Sarkar, eprint 2003/173)
  - Parallel compositions
    - A New Paradigm for Collision-free Hashing: Incrementality at Reduced Cost
      (Mihir Bellare and Daniele Micciancio, eprint 1997/001)
    - A Parallelizable Design Principle for Cryptographic Hash Functions
      (Palash Sarkar and Paul J. Schellenberg, eprint 2002/031)
Surveys, Overviews, Status reports
- "Cryptographic hash functions: a survey" by S. Bakhtiari, R. Safavi-Naini, J. Pieprzyk, 1995
- Design of Hashing Algorithms (Josef Pieprzyk, Babak Sadeghiyan)
- A study on hash functions for cryptography (Vladimir Omar, Calderón Yaksic)
- A Hash of Hash Functions (Turker Ozsari, cs.CR/0310033)
- ECRYPT Position Paper: Recent Collision Attacks on Hash Functions (2005)
Secure Signing with Hash Functions
- Collision-Resistant Hashing: Towards Making UOWHFs Practical (Mihir Bellare and Phillip Rogaway, Crypto 1997)
Block cipher->Hash function conversions
- Attacks on Fast Double Block Length Hash Functions (Lars R. Knudsen, Xuejia Lai, Bart Preneel, JoC 1997)
- New Attacks on all Double Block Length Hash Functions of Hash Rate 1, including the Parallel-DM (19.10.00)
- Hash Functions Based on Block Ciphers and Quaternary Codes (Lars Knudsen, Bart Preneel, 1996)
- Cryptanalysis of the Yi-Lam hash (David Wagner)
- Towards Secure and Fast Hash Functions (Takashi Satoh, Mio Haga, Kaoru Kurosawa, 1999)
- The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function (John Black, eprint 2005/210)
@Data structures (Incl. hash trees)
Specific Applications
- Chameleon Hashing
  - Chameleon Hashing and Signatures (Krawczyk, Rabin, 1997)
  - Identity Based Chameleon Hash and Applications (Ateniese, de Medeiros, 2003)
- Division-Intractable Hash Functions
  - Secure Hash-and-Sign Signatures without the Random Oracle (Rosario Gennaro, Shai Halevi, Tal Rabin, 1999)
  - Security Analysis of the Gennaro-Halevi-Rabin Signature Scheme (Coron, Naccache, Eurocrypt 2000)
  - Twin Signatures: An Alternative to the Hash-and-Sign Paradigm (Naccache, Pointcheval, Stern, RSA CT 2001)
  - From Fixed-Length Messages to Arbitrary-Length Messages Practical RSA Signature Padding Schemes (Arboit, Robert, RSA CT 2001)
  - Simple Identity-Based Cryptography with Mediated RSA (Xuhua Ding and Gene Tsudik, RSA CT 2003)
- Authentication Codes
  - Bibliography on Authentication Codes (Stinson, Wei)
- Incremental Hash Functions
  - A New Paradigm for Collision-free Hashing: Incrementality at Reduced Cost (Mihir Bellare and Daniele Micciancio, eprint 1997/001)
@Universal Hash Functions
@Message Authentication Codes (MACs)
A Bibliography of Publications on Hashing Algorithms (Nelson H. F. Beebe)
Crypto++ 4.0 Benchmarks (Speed Comparison of Popular Crypto Algorithms)
Link farms
- Hash Algorithms (SecuritTechNet.Com)
@Practical Pseudorandom Functions
Workshops
- 2nd NIST Hash Workshop
- Notes from 2nd NIST Hash Workshop (Paul Hoffmann etc)
Theses
- Analysis and Design of Cryptographic Hash Functions, MAC Algorithms and Block Ciphers (Bart Van Rompay, Leuven, PhD thesis, 2004)
Cryptology Pointers by Helger Lipmaa
Got any suggestions or additional links? Mail to <helger.lipmaa>gmail.com
NB! If you find any broken links, please be kind and report them to me together with their current location!

(C) Helger Lipmaa 1997-2009.