University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Theory and practice for hash functions

Theory and practice for hash functions

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani.

Semantics and Syntax: A Legacy of Alan Turing

In the last seven years we have witnessed a surge in the cryptanalysis of hash functions. The most visible result was the cryptanalysis of MD5 and SHA -1 by Wang et al., but there have been other results including multi-collision attacks, long message second preimage attacks, and rebound attacks. There has also been substantial progress in understanding security definitions and models (e.g. indifferentiability) and a large number of security reductions has been proven. In 2007, NIST has launched the call for the SHA -3 competition. In 2008 more than 60 submissions were received, which makes this the largest open cryptographic competition to date. In this talk we will discuss the impact of the research on hash functions on practice and the interaction between theory and practice in the SHA -3 competition.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity