zbMATH — the first resource for mathematics

Practical pseudo-collisions for hash functions ARIRANG-224/384. (English) Zbl 1267.94063
Jacobson, Michael J. jun. (ed.) et al., Selected areas in cryptography. 16th annual international workshop, SAC 2009, Calgary, Alberta, Canada, August 13–14, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-05443-3/pbk). Lecture Notes in Computer Science 5867, 141-156 (2009).
Summary: In this paper we analyse the security of the SHA-3 candidate ARIRANG. We show that bitwise complementation of whole registers turns out to be very useful for constructing high-probability differential characteristics in the function. We use this approach to find near-collisions with Hamming weight 32 for the full compression function as well as collisions for the compression function of ARIRANG reduced to 26 rounds, both with complexity close to $$2^{0}$$ and memory requirements of only a few words. We use near collisions for the compression function to construct pseudo-collisions for the complete hash functions ARIRANG-224 and ARIRANG-384 with complexity $$2^{23}$$ and close to $$2^{0}$$, respectively. We implemented the attacks and provide examples of appropriate pairs of $$H,M$$ values. We also provide possible configurations which may give collisions for step-reduced and full ARIRANG.
For the entire collection see [Zbl 1177.94012].

MSC:
 94A60 Cryptography
Full Text: