Name
Abstract | ||
|---|---|---|
This paper proposes a preimage attack on SM3 hash function reduced to 30 steps. SM3 is an iterated hash function based on the Merkle-Damgård design. It is a hash function used in applications such as the electronic certification service system in China. Our cryptanalysis is based on the Meet-in-the-Middle (MITM) attack. We utilize several techniques such as initial structure, partial matching and message compensation to improve the standard MITM preimage attack. Moreover, we use some observations on the SM3 hash function to optimize the computation complexity. Overall, a preimage of 30 steps SM3 hash function can be computed with a complexity of 2249 SM3 compression function computation, and requires a memory of 216. As far as we know, this is yet the first preimage result on the SM3 hash function. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-31912-9_25 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Keywords | Field | DocType |
preimage attack,iterated hash,hash function,preimage result,sm3 hash,computation complexity,standard mitm preimage attack,steps sm3 hash function,sm3 hash function,sm3 compression function computation | SHA-2,Double hashing,Computer science,Cryptographic hash function,Theoretical computer science,Hash function,Hash chain,Preimage attack,Collision attack,MDC-2 | Conference |
Volume | Issue | ISSN |
7259 LNCS | null | 16113349 |
Citations | PageRank | References |
5 | 0.45 | 20 |
Authors | ||
5 | ||