Analysis of SHA-512/224 and SHA-512/256

被引：30

作者：

Dobraunig, Christoph ^{[1
]}

Eichlseder, Maria ^{[1
]}

Mendel, Florian ^{[1
]}

机构：

[1] Graz Univ Technol, A-8010 Graz, Austria

来源：

ADVANCES IN CRYPTOLOGY - ASIACRYPT 2015, PT II | 2015年 / 9453卷

关键词：

Hash functions; Cryptanalysis; Collisions; Free-start collisions; SHA-512/224; SHA-512/256; SHA-512; SHA-2; HASH FUNCTIONS; COLLISIONS;

D O I：

10.1007/978-3-662-48800-3_25

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In 2012, NIST standardized SHA-512/224 and SHA-512/256, two truncated variants of SHA-512, in FIPS 180-4. These two hash functions are faster than SHA-224 and SHA-256 on 64-bit platforms, while maintaining the same hash size and claimed security level. So far, no third-party analysis of SHA-512/224 or SHA-512/256 has been published. In this work, we examine the collision resistance of step-reduced versions of SHA-512/224 and SHA-512/256 by using differential cryptanalysis in combination with sophisticated search tools. We are able to generate practical examples of free-start collisions for 44-step SHA-512/224 and 43-step SHA-512/256. Thus, the truncation performed by these variants on their larger state allows us to attack several more rounds compared to the untruncated family members. In addition, we improve upon the best published collisions for 24-step SHA-512 and present practical collisions for 27 steps of SHA-512/224, SHA-512/256, and SHA-512.

引用

页码：612 / 630

页数：19

共 17 条

[1]

[Anonymous], LNCS

[2]

Aoki K, 2009, LECT NOTES COMPUT SC, V5912, P578, DOI 10.1007/978-3-642-10366-7_34

[3]

Brassard G., 1990, LNCS, V435

[4]

Canteaut A., 2012, LNCS, V7549

[5]

De Canniere C., 2006, LNCS, V4284, P1

[6] Branching Heuristics in Differential Collision Search with Applications to SHA-512 [J].

Eichlseder, Maria ;

Mendel, Florian ;

Schlaeffer, Martin .

FAST SOFTWARE ENCRYPTION, FSE 2014, 2015, 8540 :473-488

[7]

Gueron S., 2011, Proceedings of the 2011 Eighth International Conference on Information Technology: New Generations (ITNG), P354, DOI 10.1109/ITNG.2011.69

[8]

Indesteege S, 2009, LECT NOTES COMPUT SC, V5381, P276, DOI 10.1007/978-3-642-04159-4_18

[9]

Joux A, 2004, LECT NOTES COMPUT SC, V3152, P306

[10]

Kelsey J, 2006, LECT NOTES COMPUT SC, V4004, P183

← 1 2 →