Paper 2011/037

Higher-Order Differential Attack on Reduced SHA-256

Mario Lamberger and Florian Mendel

Abstract

In this work, we study the application of higher-order differential attacks on hash functions. We show a second-order differential attack on the SHA-256 compression function reduced to 46 out of 64 steps. We implemented the attack and give the result in Table 1. The best attack so far (in a different attack model) with practical complexity was for 33 steps of the compression function.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Unknown where it was published
Keywords
hash functionshigher-order differentialsnon-randomnessboomerang attackSHA-256
Contact author(s)
florian mendel @ iaik tugraz at
History
2011-01-21: received
Short URL
https://ia.cr/2011/037
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2011/037,
      author = {Mario Lamberger and Florian Mendel},
      title = {Higher-Order Differential Attack on Reduced SHA-256},
      howpublished = {Cryptology ePrint Archive, Paper 2011/037},
      year = {2011},
      note = {\url{https://eprint.iacr.org/2011/037}},
      url = {https://eprint.iacr.org/2011/037}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.