{"id":49,"date":"2011-06-22T08:50:57","date_gmt":"2011-06-22T06:50:57","guid":{"rendered":"http:\/\/blog.nebule.org\/?p=49"},"modified":"2016-03-29T19:05:46","modified_gmt":"2016-03-29T17:05:46","slug":"duree-de-vie-des-hashoires","status":"publish","type":"post","link":"https:\/\/blog.nebule.org\/?p=49","title":{"rendered":"Dur\u00e9e de vie des HASHoires"},"content":{"rendered":"

Un lien synth\u00e9tise les fin de vie de diff\u00e9rentes fonctions de Hash :
\nhttp:\/\/valerieaurora.org\/hash.html<\/a><\/p>\n

<\/p>\n

Copie de cette page \u00e0 ce jour :<\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
Life cycles of popular cryptographic hashes (the \u00ab\u00a0Breakout\u00a0\u00bb chart)<\/th>\n<\/tr>\n
Function<\/td>\n1990<\/td>\n1991<\/td>\n1992<\/td>\n1993<\/td>\n1994<\/td>\n1995<\/td>\n1996<\/td>\n1997<\/td>\n1998<\/td>\n1999<\/td>\n2000<\/td>\n2001<\/td>\n2002<\/td>\n2003<\/td>\n2004<\/td>\n2005<\/td>\n2006<\/td>\n2007<\/td>\n2008<\/td>\n2009<\/td>\n<\/tr>\n
Snefru<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
MD4<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
MD5<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
MD2<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
RIPEMD<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
HAVAL-128<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
SHA-0<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
SHA-1<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
RIPEMD-128 [1]<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
RIPEMD-160<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
SHA-2 family<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
\n\n\n\n\n\n
Key<\/th>\nUnbroken<\/td>\nWeakened<\/td>\nBroken<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/td>\n<\/tr>\n
[1] Note that 128-bit hashes are at best 2^64 complexity to break; using a 128-bit hash is irresponsible based on sheer digest length.<\/td>\n<\/tr>\n
The Hash Function Lounge<\/a> has an excellent list of references for the dates.<\/td>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n\n\n\n\n\n\n\n\n\n\n\n\n
Reactions to stages in the life cycle of cryptographic hash functions<\/th>\n<\/tr>\n
Stage<\/th>\n Expert reaction<\/th>\n Programmer reaction<\/th>\n Non-expert (\u00ab\u00a0slashdotter\u00a0\u00bb) reaction<\/th>\n<\/tr>\n
Initial proposal<\/th>\nSkepticism, don’t recommend use in practice<\/td>\nWait to hear from the experts before adding to OpenSSL<\/td>\nSHA-what?<\/td>\n<\/tr>\n
Peer reviewal<\/th>\nModerate effort to find holes and garner an easy publication<\/td>\nUsed by a particularly adventurous developers for specific purposes<\/td>\nName-drop the hash at cocktail parties to impress other geeks<\/td>\n<\/tr>\n
General acceptance<\/th>\nTop-level researchers begin serious work on finding a weakness (and international fame)<\/td>\nEven Microsoft is using the hash function now<\/td>\nFlame anyone who suggests the function may be broken in our lifetime<\/td>\n<\/tr>\n
Minor weakness discovered<\/th>\nMassive downloads of turgid pre-prints from arXiv, calls for new hash functions<\/td>\nStart reviewing other hash functions for replacement<\/td>\nLong semi-mathematical posts comparing the complexity of the attack to the number of protons in the universe<\/td>\n<\/tr>\n
Serious weakness discovered<\/th>\nTension-filled CRYPTO rump sessions! A full break is considered inevitable<\/td>\nMigrate to new hash functions immediately, where necessary<\/td>\nPoint out that no actual collisions have been found<\/td>\n<\/tr>\n
First collision found<\/th>\nUncork the champagne! Interest in the details of the construction, but no surprise<\/td>\nGather around a co-worker’s computer, comparing the colliding inputs and running the hash function on them<\/td>\nExplain why a simple collision attack is still useless, it’s really the second pre-image attack that counts<\/td>\n<\/tr>\n
Meaningful collisions generated on home computer<\/th>\nHow adorable! I’m busy trying to break this new hash function, though<\/td>\nSend each other colliding X.509 certificates as pranks<\/td>\nTell people at parties that you always knew it would be broken<\/td>\n<\/tr>\n
Collisions generated by hand<\/th>\nMemorize as fun party trick for next faculty mixer<\/td>\nBoggle<\/td>\nTry to remember how to do long division by hand<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

Copyright 2007 – 2009 Valerie Aurora<\/em><\/p>\n","protected":false},"excerpt":{"rendered":"

Un lien synth\u00e9tise les fin de vie de diff\u00e9rentes fonctions de Hash : http:\/\/valerieaurora.org\/hash.html<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[3,4],"tags":[],"_links":{"self":[{"href":"https:\/\/blog.nebule.org\/index.php?rest_route=\/wp\/v2\/posts\/49"}],"collection":[{"href":"https:\/\/blog.nebule.org\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.nebule.org\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.nebule.org\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.nebule.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=49"}],"version-history":[{"count":1,"href":"https:\/\/blog.nebule.org\/index.php?rest_route=\/wp\/v2\/posts\/49\/revisions"}],"predecessor-version":[{"id":2386,"href":"https:\/\/blog.nebule.org\/index.php?rest_route=\/wp\/v2\/posts\/49\/revisions\/2386"}],"wp:attachment":[{"href":"https:\/\/blog.nebule.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=49"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.nebule.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=49"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.nebule.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=49"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}