Complexity of Differential Attacks on SHA-0 with Various Message Schedules

M. HATTORI
2005 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
The security of SHA-0 with various message schedules is discussed in this letter. SHA-0 employs a primitive polynomial of degree 16 over GF(2) in its message schedule. For each primitive polynomial, a SHA-0 variant can be constructed. The collision resistance and the near-collision resistance of SHA-0 variants to the Chabaud-Joux attack are evaluated. Moreover, the near-collision resistance of a variant to the Biham-Chen attack is evaluated. It is shown that the selection of primitive
more » ... s highly affects the resistance. However, it is concluded that these SHA-0 variants are not appropriate for making SHA-0 secure. key words: hash function,
doi:10.1093/ietfec/e88-a.12.3668 fatcat:a3j3s6q5anhi7j55g5oxdukz6q