Practical Pseudo-collisions for Hash Functions ARIRANG-224/384

Jian Guo; Krystian Matusiewicz; Lars Ramkilde Knudsen; San Ling; Huaxiong Wang

doi:10.1007/978-3-642-05445-7

Practical Pseudo-collisions for Hash Functions ARIRANG-224/384

Jian Guo, Krystian Matusiewicz, Lars Ramkilde Knudsen, San Ling, Huaxiong Wang

Nanyang Technological University

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Abstract

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.

Original language	English
Title of host publication	Selected Areas in Cryptography : 16th Annual International Workshop
Editors	Michael J. Jacobson, Vincent Rijmen, Reihaneh Safavi-Naini
Number of pages	467
Volume	5867
Place of Publication	Berlin Heidelberg
Publisher	Springer
Publication date	2009
Edition	1st
Pages	141-156
ISBN (Print)	978-3-642-05443-3
DOIs	https://doi.org/10.1007/978-3-642-05445-7
Publication status	Published - 2009
Event	Selected Areas in Cryptography: 16th Annual International Workshop - Calgary, Canada Duration: 13 Aug 2009 → 14 Aug 2009 Conference number: 16

Workshop

Workshop	Selected Areas in Cryptography: 16th Annual International Workshop
Number	16
Country/Territory	Canada
City	Calgary
Period	13/08/2009 → 14/08/2009

Keywords

pseudo-collision
practical
ARIRANG

Access to Document

10.1007/978-3-642-05445-7

http://www.springerlink.com/content/54648057067057k6/

OpenUrl availability

Full text

Cite this

@inproceedings{30a3666a47be478f855514e141461a32,

title = "Practical Pseudo-collisions for Hash Functions ARIRANG-224/384",

abstract = "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\textasciicircum{}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\textasciicircum{}23 and close to 2\textasciicircum{}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.",

keywords = "pseudo-collision, practical, ARIRANG, hash function",

author = "Jian Guo and Krystian Matusiewicz and Knudsen, \{Lars Ramkilde\} and San Ling and Huaxiong Wang",

year = "2009",

doi = "10.1007/978-3-642-05445-7",

language = "English",

isbn = "978-3-642-05443-3",

volume = "5867",

pages = "141--156",

editor = "Jacobson, \{Michael J.\} and Vincent Rijmen and Reihaneh Safavi-Naini",

booktitle = "Selected Areas in Cryptography",

publisher = "Springer",

edition = "1st",

note = "Selected Areas in Cryptography: 16th Annual International Workshop, SAC 2009 ; Conference date: 13-08-2009 Through 14-08-2009",

}

Guo, J, Matusiewicz, K, Knudsen, LR, Ling, S & Wang, H 2009, Practical Pseudo-collisions for Hash Functions ARIRANG-224/384. in MJ Jacobson, V Rijmen & R Safavi-Naini (eds), Selected Areas in Cryptography: 16th Annual International Workshop. 1st edn, vol. 5867, Springer, Berlin Heidelberg, pp. 141-156, Selected Areas in Cryptography: 16th Annual International Workshop, Calgary, Canada, 13/08/2009. https://doi.org/10.1007/978-3-642-05445-7

Practical Pseudo-collisions for Hash Functions ARIRANG-224/384. / Guo, Jian; Matusiewicz, Krystian; Knudsen, Lars Ramkilde et al.
Selected Areas in Cryptography: 16th Annual International Workshop. ed. / Michael J. Jacobson; Vincent Rijmen; Reihaneh Safavi-Naini. Vol. 5867 1st. ed. Berlin Heidelberg: Springer, 2009. p. 141-156.

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

TY - GEN

T1 - Practical Pseudo-collisions for Hash Functions ARIRANG-224/384

AU - Guo, Jian

AU - Matusiewicz, Krystian

AU - Knudsen, Lars Ramkilde

AU - Ling, San

AU - Wang, Huaxiong

N1 - Conference code: 16

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

KW - pseudo-collision

KW - practical

KW - ARIRANG

KW - hash function

U2 - 10.1007/978-3-642-05445-7

DO - 10.1007/978-3-642-05445-7

M3 - Article in proceedings

SN - 978-3-642-05443-3

VL - 5867

SP - 141

EP - 156

BT - Selected Areas in Cryptography

A2 - Jacobson, Michael J.

A2 - Rijmen, Vincent

A2 - Safavi-Naini, Reihaneh

PB - Springer

CY - Berlin Heidelberg

T2 - Selected Areas in Cryptography: 16th Annual International Workshop

Y2 - 13 August 2009 through 14 August 2009

ER -

Practical Pseudo-collisions for Hash Functions ARIRANG-224/384

Abstract

Workshop

Keywords

Access to Document

OpenUrl availability

Fingerprint

Cite this