Practical pseudo-collisions for hash functions ARIRANG-224/384

Jian Guo*, Krystian Matusiewicz, Lars R. Knudsen, San Ling, Huaxiong Wang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

4 Citations (Scopus)


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 20 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 223 and close to 20, 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.

Original languageEnglish
Title of host publicationSelected Areas in Cryptography - 16th Annual International Workshop, SAC 2009, Revised Selected Papers
EditorsMichael J. Jacobson Jr., Vincent Rijmen, Reihaneh Safavi-Naini
Place of PublicationBerlin; Heidelberg
PublisherSpringer, Springer Nature
Number of pages16
ISBN (Print)3642054439, 9783642054433
Publication statusPublished - Sept 2009
Event16th Annual International Workshop on Selected Areas in Cryptography, SAC - 2009 - Calgary, Canada
Duration: 13 Aug 200914 Aug 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5867 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349


Other16th Annual International Workshop on Selected Areas in Cryptography, SAC - 2009


  • Hash function
  • Practical
  • Pseudo-collision


Dive into the research topics of 'Practical pseudo-collisions for hash functions ARIRANG-224/384'. Together they form a unique fingerprint.

Cite this