dc.citation.conferencePlace |
AU |
- |
dc.citation.conferencePlace |
Graz |
- |
dc.citation.endPage |
110 |
- |
dc.citation.startPage |
89 |
- |
dc.citation.title |
13th International Workshop on Fast Software Encryption, FSE 2006 |
- |
dc.contributor.author |
Yun, Aaram |
- |
dc.contributor.author |
Park, Sangwoo |
- |
dc.contributor.author |
Wang, Xiaoyun |
- |
dc.contributor.author |
Yu, Hongbo |
- |
dc.date.accessioned |
2023-12-20T05:09:49Z |
- |
dc.date.available |
2023-12-20T05:09:49Z |
- |
dc.date.created |
2014-12-23 |
- |
dc.date.issued |
2006-03-15 |
- |
dc.description.abstract |
HAVAL is a cryptographic hash function with variable digest size proposed by Zheng, Pieprzyk and Seberry in 1992, It has three variants, 3-, 4-, and 5-pass HAVAL, Previous results on HAVAL suggested only practical collision attacks for 3-pass HAVAL, In this paper, we present collision attacks for 4 and 5 pass HAVAL, For 4-pass HAVAL, we describe two practical attacks for finding 2-block collisions, one with 243 computations and the other with 236 computations. In addition, we show that collisions for 5-pass HAVAL can be found with about 2123 computations, which is the first attack more efficient than the birthday attack. |
- |
dc.identifier.bibliographicCitation |
13th International Workshop on Fast Software Encryption, FSE 2006, pp.89 - 110 |
- |
dc.identifier.issn |
0302-9743 |
- |
dc.identifier.scopusid |
2-s2.0-33746695391 |
- |
dc.identifier.uri |
https://scholarworks.unist.ac.kr/handle/201301/35811 |
- |
dc.identifier.url |
https://link.springer.com/chapter/10.1007%2F11799313_7 |
- |
dc.language |
영어 |
- |
dc.publisher |
13th International Workshop on Fast Software Encryption, FSE 2006 |
- |
dc.title |
Cryptanalysis of the Full HAVAL with 4 and 5 Passes |
- |
dc.type |
Conference Paper |
- |
dc.date.conferenceDate |
2006-03-15 |
- |