Quelle est la solidit\u00e9 de l’algorithme de hash SHA256?<\/p>\n
Le site www.ecrypt.eu.org<\/a> (ECRYPT II) diffuse un document D.SPA.17.pdf<\/a> (sans licence apparente) r\u00e9capitulant les propri\u00e9t\u00e9s d’algorithmes cryptographiques et de pratiques. Ce document r\u00e9capitule les travaux sur ces algorithmes et m\u00e9thodes, et \u00e9value la solidit\u00e9 de ceux-ci.<\/p>\n Le site www.keylength.com<\/a> r\u00e9f\u00e9rence les recommandations de diff\u00e9rents organismes gouvernementaux et notamment celles de l’ANSSI<\/a>. Les recommandations de l’ANSSI<\/a> sont disponibles dans le document RGS_B_1.pdf<\/a>.<\/p>\n Conclusion, SHA256 est adapt\u00e9 \u00e0 l’utilisation que l’on en fait aujourd’hui dans nebule.<\/p>\n <\/p>\n Extrait du document\u00c2\u00a0D.SPA.17.pdf<\/a> concernant SHA256 :<\/p>\n De\u00ef\u00ac\u0081nition:<\/strong> NIST FIPS 180-2, [199] (Also part of Suite-B [218], ISO\/IES 10118-3). Copie du document : Quelle est la solidit\u00e9 de l’algorithme de hash SHA256? Le site www.ecrypt.eu.org (ECRYPT II) diffuse un document D.SPA.17.pdf (sans licence apparente) r\u00e9capitulant les propri\u00e9t\u00e9s d’algorithmes cryptographiques et de pratiques. Ce document r\u00e9capitule les travaux sur ces algorithmes et m\u00e9thodes, et \u00e9value la solidit\u00e9 de ceux-ci. Le site www.keylength.com r\u00e9f\u00e9rence les recommandations de diff\u00e9rents organismes gouvernementaux … Continuer la lecture de SHA256?<\/span><\/a><\/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":"http:\/\/blog.nebule.org\/index.php?rest_route=\/wp\/v2\/posts\/379"}],"collection":[{"href":"http:\/\/blog.nebule.org\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/blog.nebule.org\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/blog.nebule.org\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"http:\/\/blog.nebule.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=379"}],"version-history":[{"count":1,"href":"http:\/\/blog.nebule.org\/index.php?rest_route=\/wp\/v2\/posts\/379\/revisions"}],"predecessor-version":[{"id":2337,"href":"http:\/\/blog.nebule.org\/index.php?rest_route=\/wp\/v2\/posts\/379\/revisions\/2337"}],"wp:attachment":[{"href":"http:\/\/blog.nebule.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=379"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/blog.nebule.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=379"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/blog.nebule.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=379"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}10.7 SHA-224, SHA-256<\/h2>\n
\nParameters:<\/strong> 224-bit and 256-bit hash outputs respectively, max input size 264 \u00e2\u02c6\u2019 1 bits.
\nSecurity:<\/strong> As claimed; collision search requires 2^112 and 2^128 iterations of the compression function respectively.
\nDeployment:<\/strong> Likely to become widespread.
\nImplementation:<\/strong>
\nPublic analysis:<\/strong> Cryptrec report [68]. See also [96, 112].
\nKnown weakness:<\/strong>
\nComments:<\/strong> Collisions on SHA have been reported. While SHA has some similarities, it is also a signi\u00ef\u00ac\u0081cantly di\u00ef\u00ac\u20acerent design to SHA-224 and SHA-256. SHA-224 is identical to SHA-256, except that it uses a di\u00ef\u00ac\u20acerent IV and truncates the output. Simpli\u00ef\u00ac\u0081ed variants of SHA-256 have been analyzed in [180, 190, 289].
\nPractical collision attacks for up to 24 (out of 64) steps have been reported [122, 246]. Preimage attacks for SHA-256 reduced to 43 (out of 64) steps have also been reported [15, 105].<\/p>\n
\n– D.SPA.17<\/a> (SHA256 : a1f20d3625c08cbd014f58af54c21dc335f65cd3b6a0f899b3129aa8dd8249dc)
\n-\u00c2\u00a0RGS_B_1<\/a> (SHA256 : bbebb1b9c21fa5c572e98c1af327db5799fed27d6b03d492462a5ce440a2196d)<\/p>\n","protected":false},"excerpt":{"rendered":"