Abstract
In this paper, we present the preimage attacks on step-reduced ARIRANG and PKC98-Hash. Our attacks find the preimages of 35 steps out of 40 steps of ARIRANG and 80 steps out of 96 steps of PKC98-Hash, faster than the brute force attack. We applied recently developed techniques of preimage attack. Our attack for ARIRANG is the improvement of the previous attack, and our attack for PKC98-hash is the first analysis result of its preimage resistance. © 2010 Springer-Verlag.
Author supplied keywords
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Cite
CITATION STYLE
Hong, D., Koo, B., Kim, W. H., & Kwon, D. (2010). Preimage attacks on reduced steps of ARIRANG and PKC98-hash. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5984 LNCS, pp. 315–331). https://doi.org/10.1007/978-3-642-14423-3_21
Readers over time
Readers' Seniority
Readers' Discipline
