Finding Collisions for Round-Reduced SM3

Florian Mendel; Tomislav Nad; Martin Schläffer

doi:10.1007/978-3-642-36095-4_12

Finding Collisions for Round-Reduced SM3

Florian Mendel
, Tomislav Nad
, Martin Schläffer

Institute of Information Security (7050)

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

Abstract

In this work, we provide the first security analysis of reduced SM3 regarding its collision resistance. SM3 is a Chinese hash function standard published by the Chinese Commercial Cryptography Administration Office for the use of electronic authentication service systems and hence, might be used in several cryptographic applications in China. So far only few results have been published for the SM3 hash function. Since the design of SM3 is very similar to the MD4 family of hash functions and in particular to SHA-2, a revaluation of the security of SM3 regarding collision resistance is important taking into account recent advances in the cryptanalysis of SHA-2. In this paper, we extend the methods used in the recent collision attacks on SHA-2 and show how the techniques can be effectively applied to SM3. Our results are a collision attack on the hash function for 20 out of 64 steps and a free-start collision attack for 24 steps of SM3, both with practical complexity.

Original language	English
Title of host publication	Topics in Cryptology - CT-RSA 2013
Place of Publication	Berlin; Heidelberg
Publisher	Springer
Pages	174-188
ISBN (Print)	978-3-642-36094-7
DOIs	https://doi.org/10.1007/978-3-642-36095-4_12
Publication status	Published - 2013
Event	Cryptographers' Track at the RSA Conference 2013: CT-RSA 2013 - San Francisco, United States Duration: 25 Feb 2013 → 1 Mar 2013

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	7779

Conference

Conference	Cryptographers' Track at the RSA Conference 2013
Country/Territory	United States
City	San Francisco
Period	25/02/13 → 1/03/13

Fields of Expertise

Information, Communication & Computing

Access to Document

10.1007/978-3-642-36095-4_12

sm3Final published version, 346 KB

FWF - kryptographische Hashfu - Cryptanalysis of modern cryptographic hash functions II
Nad, T. (Attendee / Assistant), Rijmen, V. (Project manager), Schläffer, M. (Attendee / Assistant), Lamberger, M. (Contact person), Mendel, F. (Attendee / Assistant) & Posch, R. (Project manager on research unit)
1/02/10 → 31/01/13
Project: Research project
EU - ECRYPT II - European network of excellence in cryptology - Phase II
Medwed, M. (Attendee / Assistant), Lamberger, M. (Attendee / Assistant), Rechberger, C. (Attendee / Assistant), Aigner, M. J. (Attendee / Assistant), Feldhofer, M. (Attendee / Assistant), Hutter, M. (Attendee / Assistant), Mendel, F. (Attendee / Assistant), Nad, T. (Attendee / Assistant), Kirschbaum, M. (Attendee / Assistant), Rijmen, V. (Attendee / Assistant), Tillich, S. (Attendee / Assistant), Schläffer, M. (Contact person), Posch, R. (Project manager) & Schmidt, J.-M. (Attendee / Assistant)
1/08/08 → 31/01/13
Project: Research project
Cryptography
Schläffer, M. (Attendee), Rijmen, V. (Coordinator), Oswald, M. E. (Contact person), Rechberger, C. (Attendee), Posch, R. (Contact person), Lamberger, M. (Attendee), Mendel, F. (Attendee), Eichlseder, M. (Attendee), Nad, T. (Attendee), Dobraunig, C. E. (Attendee) & Lipp, P. (Attendee)
1/01/95 → 31/01/19
Project: Research area

Cite this

@inproceedings{fc12254057dd4a5daa4154f227aab042,

title = "Finding Collisions for Round-Reduced SM3",

abstract = "In this work, we provide the first security analysis of reduced SM3 regarding its collision resistance. SM3 is a Chinese hash function standard published by the Chinese Commercial Cryptography Administration Office for the use of electronic authentication service systems and hence, might be used in several cryptographic applications in China. So far only few results have been published for the SM3 hash function. Since the design of SM3 is very similar to the MD4 family of hash functions and in particular to SHA-2, a revaluation of the security of SM3 regarding collision resistance is important taking into account recent advances in the cryptanalysis of SHA-2. In this paper, we extend the methods used in the recent collision attacks on SHA-2 and show how the techniques can be effectively applied to SM3. Our results are a collision attack on the hash function for 20 out of 64 steps and a free-start collision attack for 24 steps of SM3, both with practical complexity.",

author = "Florian Mendel and Tomislav Nad and Martin Schl{\"a}ffer",

year = "2013",

doi = "10.1007/978-3-642-36095-4\_12",

language = "English",

isbn = "978-3-642-36094-7",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "174--188",

booktitle = "Topics in Cryptology - CT-RSA 2013",

address = "United States",

note = "Cryptographers' Track at the RSA Conference 2013 : CT-RSA 2013 ; Conference date: 25-02-2013 Through 01-03-2013",

}

TY - GEN

T1 - Finding Collisions for Round-Reduced SM3

AU - Mendel, Florian

AU - Nad, Tomislav

AU - Schläffer, Martin

PY - 2013

Y1 - 2013

N2 - In this work, we provide the first security analysis of reduced SM3 regarding its collision resistance. SM3 is a Chinese hash function standard published by the Chinese Commercial Cryptography Administration Office for the use of electronic authentication service systems and hence, might be used in several cryptographic applications in China. So far only few results have been published for the SM3 hash function. Since the design of SM3 is very similar to the MD4 family of hash functions and in particular to SHA-2, a revaluation of the security of SM3 regarding collision resistance is important taking into account recent advances in the cryptanalysis of SHA-2. In this paper, we extend the methods used in the recent collision attacks on SHA-2 and show how the techniques can be effectively applied to SM3. Our results are a collision attack on the hash function for 20 out of 64 steps and a free-start collision attack for 24 steps of SM3, both with practical complexity.

AB - In this work, we provide the first security analysis of reduced SM3 regarding its collision resistance. SM3 is a Chinese hash function standard published by the Chinese Commercial Cryptography Administration Office for the use of electronic authentication service systems and hence, might be used in several cryptographic applications in China. So far only few results have been published for the SM3 hash function. Since the design of SM3 is very similar to the MD4 family of hash functions and in particular to SHA-2, a revaluation of the security of SM3 regarding collision resistance is important taking into account recent advances in the cryptanalysis of SHA-2. In this paper, we extend the methods used in the recent collision attacks on SHA-2 and show how the techniques can be effectively applied to SM3. Our results are a collision attack on the hash function for 20 out of 64 steps and a free-start collision attack for 24 steps of SM3, both with practical complexity.

U2 - 10.1007/978-3-642-36095-4_12

DO - 10.1007/978-3-642-36095-4_12

M3 - Conference paper

SN - 978-3-642-36094-7

T3 - Lecture Notes in Computer Science

SP - 174

EP - 188

BT - Topics in Cryptology - CT-RSA 2013

PB - Springer

CY - Berlin; Heidelberg

T2 - Cryptographers' Track at the RSA Conference 2013

Y2 - 25 February 2013 through 1 March 2013

ER -

Finding Collisions for Round-Reduced SM3

Abstract

Publication series

Conference

Fields of Expertise

Access to Document

Fingerprint

Projects

FWF - kryptographische Hashfu - Cryptanalysis of modern cryptographic hash functions II

EU - ECRYPT II - European network of excellence in cryptology - Phase II

Cryptography

Cite this