作者: Bart Preneel
DOI: 10.1007/978-3-642-11925-5_1
关键词: Cryptographic hash function 、 Security of cryptographic hash functions 、 Computer security 、 Computer science 、 NIST hash function competition 、 Theoretical computer science 、 SHA-2 、 Collision attack 、 Secure Hash Algorithm 、 Hash chain 、 Hash function
摘要: The first designs of cryptographic hash functions date back to the late 1970s; more proposals emerged in 1980s. During 1990s, number function grew very quickly, but for many these security flaws were identified. MD5 and SHA-1 deployed an ever increasing applications, resulting name “Swiss army knifes” cryptography. In spite importance functions, only limited effort was spent on studying their formal definitions foundations. 2004 Wang et al. perfected differential cryptanalysis a point that finding collisions became easy; substantial reduction margin obtained. This breakthrough has resulted flurry research, new constructions growing body foundational research. NIST announced November 2007 it would organize SHA-3 competition, with as goal select family by 2012. From 64 candidates submitted October 2008, 14 have made second round. paper presents brief overview state 30 years after introduction; also discusses progress competition.