Analysis of step-reduced SHA-256
作者： Florian Mendel , Norbert Pramstaller , Christian Rechberger , Vincent Rijmen
DOI: 10.1007/11799313_9
关键词: Collision 、 Hash function 、 Boolean function 、 Mathematics 、 Modular design 、 Algorithm
摘要: This is the first article analyzing security of SHA-256 against fast collision search which considers recent attacks by Wang et al. We show limits applying techniques known so far to SHA-256. Next we introduce a new type perturbation vector circumvents identified limits. technique then applied unmodified Exploiting combination Boolean functions and modular addition together with newly developed allows us derive collision-producing characteristics for step-reduced SHA-256, was not possible before. Although our results do threaten that low probability single local may give rise false sense security.
springer.com
core.ac.uk
elsevier.com
kuleuven.be 
researchgate.net 
sci-hub.st 参考文章(22)
Anindya C. Patthak, Charanjit S. Jutla, A Matching Lower Bound on the Minimum Weight of SHA-1 Expansion Code. IACR Cryptology ePrint Archive. ,vol. 2005, pp. 266- ,(2005)
Jongsung Kim, Guil Kim, Sangjin Lee, Jongin Lim, Junghwan Song, Related-Key Attacks on Reduced Rounds of SHACAL-2 Progress in Cryptology - INDOCRYPT 2004. ,vol. 3348, pp. 175- 190 ,(2004) , 10.1007/978-3-540-30556-9_15
Henri Gilbert, Helena Handschuh, Security Analysis of SHA-256 and Sisters Selected Areas in Cryptography. ,vol. 3006, pp. 175- 193 ,(2004) , 10.1007/978-3-540-24654-1_13
Jan-Hendrik Evertse, David Chaum, Crytanalysis of DES with a Reduced Number of Rounds: Sequences of Linear Factors in Block Ciphers international cryptology conference. pp. 192- 211 ,(1985)
Norbert Pramstaller, Christian Rechberger, Vincent Rijmen, Exploiting Coding Theory for Collision Attacks on SHA-1 Cryptography and Coding. ,vol. 3796, pp. 78- 95 ,(2005) , 10.1007/11586821_7
Vincent Rijmen, Elisabeth Oswald, Update on SHA-1 Lecture Notes in Computer Science. pp. 58- 71 ,(2005) , 10.1007/978-3-540-30574-3_6
Jacques Stern, A method for finding codewords of small weight Proceedings of the third international colloquium on Coding theory and applications. pp. 106- 113 ,(1989) , 10.1007/BFB0019850
David Chaum, Jan-Hendrik Evertse, Cryptanalysis of DES with a reduced number of rounds international cryptology conference. pp. 192- 211 ,(1986) , 10.1007/3-540-39799-X_16
Christian Rechberger, Vincent Rijmen, Krystian Matusiewicz, Josef Pieprzyk, Norbert Pramstaller, Analysis of simplified variants of SHA-256 Science & Engineering Faculty. pp. 123- 134 ,(2005)
Philip Hawkes, Gregory G. Rose, Michael Paddon, On Corrective Patterns for the SHA-2 Family. IACR Cryptology ePrint Archive. ,vol. 2004, pp. 207- ,(2004)