Analysis of simplified variants of SHA-256

Krystian Matusiewicz; Josef Pieprzyk; Norbert Pramstaller; Christian Rechberger; Vincent Rijmen

Analysis of simplified variants of SHA-256

Krystian Matusiewicz, Josef Pieprzyk, Norbert Pramstaller, Christian Rechberger, Vincent Rijmen

School of Computing

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

11 Citations (Scopus)

Abstract

In this paper we analyse the role of some of the building blocks of SHA-256. We show that the disturbance-correction strategy is applicable to the SHA-256 architecture and we prove that functions Σ σ are vital for the security of SHA-256 by showing that for a variant without them it is possible to find collisions with complexity 2⁶⁴ hash operations. As a step towards an analysis of the full function, we present the results of our experiments on Hamming weights of expanded messages for differ ent variants of the message expansion and show that there exist low-weight expanded messages for XOR-linearised variants.

Original language	English
Title of host publication	WEWoRC 2005 - Western European Workshop on Research in Cryptology
Editors	Christopher Wolf, Stefan Lucks, Po-Wah Yau
Place of Publication	Bonn
Publisher	Gesellschaft für Informatik
Pages	123-134
Number of pages	12
Volume	P-74
ISBN (Print)	3885794039, 9783885794035
Publication status	Published - 2005
Event	1st Western European Workshop on Research in Cryptology, WEWoRC - 2005 - Leuven, Belgium Duration: 5 Jul 2005 → 7 Jul 2005

Other

Other	1st Western European Workshop on Research in Cryptology, WEWoRC - 2005
Country/Territory	Belgium
City	Leuven
Period	5/07/05 → 7/07/05

Cite this

@inproceedings{84c30c789699495abe29d32eab0c6e6d,

title = "Analysis of simplified variants of SHA-256",

abstract = "In this paper we analyse the role of some of the building blocks of SHA-256. We show that the disturbance-correction strategy is applicable to the SHA-256 architecture and we prove that functions Σ σ are vital for the security of SHA-256 by showing that for a variant without them it is possible to find collisions with complexity 264 hash operations. As a step towards an analysis of the full function, we present the results of our experiments on Hamming weights of expanded messages for differ ent variants of the message expansion and show that there exist low-weight expanded messages for XOR-linearised variants.",

author = "Krystian Matusiewicz and Josef Pieprzyk and Norbert Pramstaller and Christian Rechberger and Vincent Rijmen",

year = "2005",

language = "English",

isbn = "3885794039",

volume = "P-74",

pages = "123--134",

editor = "Christopher Wolf and Stefan Lucks and Po-Wah Yau",

booktitle = "WEWoRC 2005 - Western European Workshop on Research in Cryptology",

publisher = "Gesellschaft f{\"u}r Informatik",

note = "1st Western European Workshop on Research in Cryptology, WEWoRC - 2005 ; Conference date: 05-07-2005 Through 07-07-2005",

}

Matusiewicz, K, Pieprzyk, J, Pramstaller, N, Rechberger, C & Rijmen, V 2005, Analysis of simplified variants of SHA-256. in C Wolf, S Lucks & P-W Yau (eds), WEWoRC 2005 - Western European Workshop on Research in Cryptology. vol. P-74, Gesellschaft für Informatik, Bonn, pp. 123-134, 1st Western European Workshop on Research in Cryptology, WEWoRC - 2005, Leuven, Belgium, 5/07/05.

Analysis of simplified variants of SHA-256. / Matusiewicz, Krystian; Pieprzyk, Josef; Pramstaller, Norbert et al.
WEWoRC 2005 - Western European Workshop on Research in Cryptology. ed. / Christopher Wolf; Stefan Lucks; Po-Wah Yau. Vol. P-74 Bonn: Gesellschaft für Informatik, 2005. p. 123-134.

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

TY - GEN

T1 - Analysis of simplified variants of SHA-256

AU - Matusiewicz, Krystian

AU - Pieprzyk, Josef

AU - Pramstaller, Norbert

AU - Rechberger, Christian

AU - Rijmen, Vincent

PY - 2005

Y1 - 2005

N2 - In this paper we analyse the role of some of the building blocks of SHA-256. We show that the disturbance-correction strategy is applicable to the SHA-256 architecture and we prove that functions Σ σ are vital for the security of SHA-256 by showing that for a variant without them it is possible to find collisions with complexity 264 hash operations. As a step towards an analysis of the full function, we present the results of our experiments on Hamming weights of expanded messages for differ ent variants of the message expansion and show that there exist low-weight expanded messages for XOR-linearised variants.

AB - In this paper we analyse the role of some of the building blocks of SHA-256. We show that the disturbance-correction strategy is applicable to the SHA-256 architecture and we prove that functions Σ σ are vital for the security of SHA-256 by showing that for a variant without them it is possible to find collisions with complexity 264 hash operations. As a step towards an analysis of the full function, we present the results of our experiments on Hamming weights of expanded messages for differ ent variants of the message expansion and show that there exist low-weight expanded messages for XOR-linearised variants.

UR - http://www.scopus.com/inward/record.url?scp=84896851939&partnerID=8YFLogxK

M3 - Conference proceeding contribution

AN - SCOPUS:84896851939

SN - 3885794039

SN - 9783885794035

VL - P-74

SP - 123

EP - 134

BT - WEWoRC 2005 - Western European Workshop on Research in Cryptology

A2 - Wolf, Christopher

A2 - Lucks, Stefan

A2 - Yau, Po-Wah

PB - Gesellschaft für Informatik

CY - Bonn

T2 - 1st Western European Workshop on Research in Cryptology, WEWoRC - 2005

Y2 - 5 July 2005 through 7 July 2005

ER -

Analysis of simplified variants of SHA-256

Abstract

Other

Other files and links

Fingerprint

Cite this