Paper 2009/147

Preimage Attack on ARIRANG

Deukjo Hong, Woo-Hwan Kim, and Bonwook Koo

Abstract

The hash function ARIRANG is one of the 1st round SHA-3 candidates. In this paper, we present preimage attacks on ARIRANG with step-reduced compression functions. We consider two step-reduced variants of the compression function. First one uses the same feedforward1 as the original algorithm, and the other one has the feedforward working at the output of the half steps. Our attack finds a preimage of the 33-step OFF(Original FeedForward)-variants of ARIRANG-256 and ARIRANG-512 from Step 1 to Step 33, and a preimage of the 31-step MFF(Middle FeedForward)-variants of ARIRANG-256 and ARIRANG-512 from Step 3 to Step 33.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Unknown where it was published
Keywords
hash functionpreimage attackSHA-3ARIRANG
Contact author(s)
hongdj @ ensec re kr
History
2009-03-31: received
Short URL
https://ia.cr/2009/147
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2009/147,
      author = {Deukjo Hong and Woo-Hwan Kim and Bonwook Koo},
      title = {Preimage Attack on {ARIRANG}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2009/147},
      year = {2009},
      url = {https://eprint.iacr.org/2009/147}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.