Collisions of SHA-0 and reduced SHA-1

作者: Eli Biham , Christophe Lemuet , William Jalby , Rafi Chen , Patrick Carribault

DOI:

关键词:

摘要: In this paper we describe improvements to the techniques used cryptanalyze SHA-0 and introduce first results on SHA-1. The include a generic multi-block technique that uses near-collisions in order find collisions, four-block collision of found using with complexity 2 51 . Then, extension prior are presented, allow us collisions reduced versions We give variants up 40 rounds, show complexities longer variants. These about 53-58 rounds can still be faster than by birthday attacks.

参考文章(0)