Analyze SHA-1 in message schedule
暂无分享,去创建一个
Abstract Wang et al have found a family of collisions in MD5. They reported their method to find a collision efficiently in SHA, and also to find a collision in SHA-1 within 269 hash steps in February 2005. In fact, we can still discover the decay phenomenon with the application of a message schedule’s judgment proposed in this work when inspection how SHA-1 generates message schedule actually. Therefore, we would like to introduce two SHA-1 corrections to enhance the security of SHA-1.
[1] Eli Biham,et al. Near-Collisions of SHA-0 , 2004, CRYPTO.
[2] Antoine Joux,et al. Differential Collisions in SHA-0 , 1998, CRYPTO.
[3] Paul C. van Oorschot,et al. Parallel collision search with application to hash functions and discrete logarithms , 1994, CCS '94.
[4] Dengguo Feng,et al. Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD , 2004, IACR Cryptol. ePrint Arch..