Abstract
HAVAL is a dedicated hash function of the MD family which was proposed by Zheng et al. In this paper, we study the security of reduced versions of 3-pass HAVAL. We find a 256-bit collision of the first two passes of 3-pass HAVAL and of the last two passes of 3-pass HAVAL.
| Original language | English |
|---|---|
| Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Publisher | Springer Verlag |
| Pages | 406-419 |
| Number of pages | 14 |
| Volume | 2384 |
| ISBN (Print) | 3540438610, 9783540438618 |
| Publication status | Published - 2002 |
| Event | 7th Australasian Conference on Information Security and Privacy, ACISP 2002 - Melbourne, Australia Duration: 2002 Jul 3 → 2002 Jul 5 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 2384 |
| ISSN (Print) | 03029743 |
| ISSN (Electronic) | 16113349 |
Other
| Other | 7th Australasian Conference on Information Security and Privacy, ACISP 2002 |
|---|---|
| Country | Australia |
| City | Melbourne |
| Period | 02/7/3 → 02/7/5 |
Fingerprint
ASJC Scopus subject areas
- Computer Science(all)
- Theoretical Computer Science
Cite this
Park, S., Sung, S. H., Chee, S., & Lim, J. I. (2002). On the security of reduced versions of 3-pass HAVAL. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2384, pp. 406-419). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2384). Springer Verlag.