Name
Abstract | ||
|---|---|---|
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 polynomials highly affects the resistance. However, it is concluded that these SHA-0 variants are not appropriate for making SHA-0 secure. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1093/ietfec/e88-a.12.3668 | IEICE Transactions |
Keywords | Field | DocType |
primitive polynomial,near-collision resistance,hash function,sha-0 variant,various message schedules,biham-chen attack,message schedule,biham-chen at- tack,chabaud-joux attack,sha-0,collision resistance,various message schedule,differential attacks | Primitive polynomial,Polynomial,Computer science,Collision resistance,Theoretical computer science,Schedule,Hash function | Journal |
Volume | Issue | ISSN |
E88-A | 12 | 1745-1337 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mitsuhiro Hattori | 1 | 16 | 2.64 |
| shoichi | 2 | 205 | 25.26 |
| Susumu Yoshida | 3 | 3 | 1.52 |