On the security of yet another reduced version of 3-pass HAVAL

Yong Sork Her; Kouichi Sakurai

doi:10.1109/isit.2003.1228151

On the security of yet another reduced version of 3-pass HAVAL

Yong Sork Her, Kouichi Sakurai

Mathematical Informatics

Research output: Contribution to journal › Conference article › peer-review

Abstract

We find collisions for the first and third passes of 3-pass HAVAL (following HAVAL^[1,3]) which is not using the second pass and not successive two passes. To find a collision in HAVAL^[1,3], we introduce the scheme of S.W.Park et al.

Original language	English
Number of pages	1
Journal	IEEE International Symposium on Information Theory - Proceedings
DOIs	https://doi.org/10.1109/isit.2003.1228151
Publication status	Published - 2003
Event	Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan Duration: Jun 29 2003 → Jul 4 2003

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

10.1109/isit.2003.1228151

Cite this

@article{45f068ba5066448bb4c0a0e7b0b758e6,

title = "On the security of yet another reduced version of 3-pass HAVAL",

abstract = "We find collisions for the first and third passes of 3-pass HAVAL (following HAVAL[1,3]) which is not using the second pass and not successive two passes. To find a collision in HAVAL[1,3], we introduce the scheme of S.W.Park et al.",

author = "Her, {Yong Sork} and Kouichi Sakurai",

year = "2003",

doi = "10.1109/isit.2003.1228151",

language = "English",

journal = "IEEE International Symposium on Information Theory - Proceedings",

issn = "2157-8096",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) ; Conference date: 29-06-2003 Through 04-07-2003",

}

TY - JOUR

T1 - On the security of yet another reduced version of 3-pass HAVAL

AU - Her, Yong Sork

AU - Sakurai, Kouichi

PY - 2003

Y1 - 2003

N2 - We find collisions for the first and third passes of 3-pass HAVAL (following HAVAL[1,3]) which is not using the second pass and not successive two passes. To find a collision in HAVAL[1,3], we introduce the scheme of S.W.Park et al.

AB - We find collisions for the first and third passes of 3-pass HAVAL (following HAVAL[1,3]) which is not using the second pass and not successive two passes. To find a collision in HAVAL[1,3], we introduce the scheme of S.W.Park et al.

UR - http://www.scopus.com/inward/record.url?scp=0141904643&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0141904643&partnerID=8YFLogxK

U2 - 10.1109/isit.2003.1228151

DO - 10.1109/isit.2003.1228151

M3 - Conference article

AN - SCOPUS:0141904643

SN - 2157-8096

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

T2 - Proceedings 2003 IEEE International Symposium on Information Theory (ISIT)

Y2 - 29 June 2003 through 4 July 2003

ER -

On the security of yet another reduced version of 3-pass HAVAL

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this