Message Digests for the Twenty-First Century

An Overview of the NIST SHA-3 Cryptographic Hash Algorithm Competition

Alan Kaminsky

Department of Computer Science
B. Thomas Golisano College of Computing and Information Sciences
Rochester Institute of Technology

September 27, 2009
Embedded Systems and Communications Security Workshop
28th IEEE International Symposium on Reliable Distributed Systems (SRDS 2009)
Niagara Falls, NY, USA

Presentation

• Presentation: PDF

The HashClash Project

• HashClash Project
  http://www.win.tue.nl/hashclash/

• Predicting the winner of the 2008 U.S. presidential elections using a Sony PlayStation 3 (November 30, 2007)
  http://www.win.tue.nl/hashclash/Nostradamus/
  • MD5 hash of file containing the winner: 3d515dead7aa16560aba3e9df05cbc80
  • File containing the winner: PDF

• MD5 considered harmful today: Creating a rogue CA certificate (December 30, 2008)
  http://www.win.tue.nl/hashclash/rogue-ca/

MD5 Collisions

• Thomas Pornin's MD5 collision finding program
  http://www.crypto-hash.fr/modules/wfdownloads/singlefile.php?cid=13&lid=14

The SHA-3 Competition

• NIST Cryptographic Hash Algorithm Competition
  http://csrc.nist.gov/groups/ST/hash/sha-3/

• NIST Hash Forum mailing list: hash-forum@nist.gov
  http://csrc.nist.gov/groups/ST/hash/email_list.html

• ECRYPT's SHA-3 Zoo
  http://ehash.iaik.tugraz.at/wiki/The_SHA-3_Zoo

• eBASH: ECRYPT Benchmarking of All Submitted Hashes
  http://bench.cr.yp.to/ebash.html

The SHA-3 Round 2 Candidate Specifications

These are the specifications of the SHA-3 Round 2 candidate hash functions as of 26-Sep-2009. For the latest information, refer to the NIST and SHA-3 Zoo web sites above.

BLAKE: PDF BlueMidnightWish: PDF CubeHash: PDF ECHO: PDF Fugue: PDF Groestl: PDF Hamsi: PDF

JH: PDF Keccak: PDF Luffa: PDF Shabal: PDF SHAvite-3: PDF SIMD: PDF Skein: PDF

Alan Kaminsky • Department of Computer Science • Rochester Institute of Technology • 4486 + 2220 = 6706

Home Page

Copyright © 2009 Alan Kaminsky. All rights reserved. Last updated 26-Sep-2009. Please send comments to ark­@­cs.rit.edu.