SHA-3 hash function

Details of the project titled "SHA-3 hash function" funded by the Danish Research Council for Technology and Production Sciences

• Project applicant : Praveen Gauravaram
• Principle collaborator : Lars R.Knudsen
• Funding Agency : Danish Research Council for Technology and Production Sciences
• Grant duration : 1, August 2008 - 31, July 2009.
• Grant number: 274-08-0052
• Host Institution : Department of Mathematics, Technical University of Denmark, Denmark
• Abstract of the project :

  Standard hash functions are used for efficient and secure information processing in many commercial applications. In the wake of successful cryptanalysis of several standard hash functions and their impact on the security of the several information processing applications, National Institute of Standards and Technology (NIST), USA has announced an international public competition to select the most secure and efficient hash function as the Advanced Hash Standard which will be referred to as SHA-3. The SHA-3 hash function augments the current secure hash standard FIPS 180-2 issued by NIST in 2002 and can be directly substituted for the hash functions in the FIPS 180-2 standard in the applications.

  Rigorous analysis of AHS submissions is quite essential in eliminating ineffective proposals and consequently in successful completion of the competition to select a hash function standard that would be capable of protecting the sensitive information for a foreseeable future. This research project aims to contribute to the selection of the new hash standard by carrying out the following tasks:
1. Analysis of some of the latest hash function designs and their applications
2. The analysis of some of the hash function submissions to the AHS

• Research Results:
  
  
  • Grøstl : Our SHA-3 candidate hash function submitted to the NIST's SHA-3 Competition. Visit SHA-3 zoo for a list of hash function submissions to the AHS competition.


• Publications:
  
  1. Praveen Gauravaram and Lars R. Knudsen. On Randomizing Hash Functions to Strengthen the Security of Digital Signatures.
     In the Lecture Notes in Computer Science (LNCS), Proceedings of 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques (Eurocrypt), Volume 5479, Pages 88-105, Springer, 2009. ** One of the three candidate articles for the best paper award at Eurocrypt'09.
  2. Alex Biryukov,Praveen Gauravaram, Guo Jian, Dmitry Khovratovich, San Ling, Krystian Matusiewicz, Ivica Nikolic, Josef Pieprzyk and Huaxiong Wang. Collisions for the LAKE Hash Family
     To appear In the Lecture Notes in Computer Science (LNCS), Proceedings of 16th International Workshop on Fast Software Encryption (FSE), 2009.
  3. Praveen Gauravaram, John Kelsey, Lars Knudsen and Søren Steffen Thomsen. On hash functions using checksums.
     In the Technical Report Series of Department of Mathematics, Technical University of Denmark, Denmark, pages 1-21, 2008.
  4. Praveen Gauravaram and Katsuyuki Okeya. Side channel analysis of some hash based MACs: A response to SHA-3 requirements.
     In the Lecture Notes in Computer Science (LNCS), Proceedings of 10th International Conference on Information and Communications Security (ICICS), Volume 5308, pages 111-127, Springer, 2008.


• Presentations:
  1. Analysis, Design and Applications of Hash Functions
     Invited Talk at School of Mathematics, Charles University, Prague, Czech Republic, June 17, 2009.
  2. Brain-storming session on Cryptographic Hash Functions
     Society of Electronic Transactions and Security (SETS), Chennai, India, April 3, 2009.
  3. Cryptographic Hash Functions
     Invited Talk at Tata Consultancy Services (TCS), Hyderabad, India, March 24, 2009.
  4. On Randomizing Hash Functions to Strengthen the Security of Digital Signatures
     Invited Talk at School of Physical and Mathematical Sciences, Nanyang Technological University (NTU), Singapore, March 20, 2009.
  5. An on-line birthday forgery attack on some randomized-hash-then-sign signature schemes
     ECRYPT-II Kickoff Meeting at Katholieke Universiteit Leuven, Belgium, November 25, 2008.
  6. An on-line birthday forgery attack on some RMX-hash-then-sign signature schemes
     Invited talk at the Information Security Group (ISG) Seminar Series, Royal Holloway University of London (RHUL) , October 23, 2008.
  7. Side channel analysis of some hash based MACs: A response to SHA-3 requirements
     10th International Conference on Information and Communications Security (ICICS) Birmingham, UK, October 20-22, 2008.
     
     
• News: Our hash function Grøstl has been selected for the first round of NIST's SHA-3 hash function competition.
  Presented at The First SHA-3 Candidate Conference, Katholieke Universiteit Leuven, Belgium, February 25-28, 2009.