Gesellschaft fr Informatik e.V.

Lecture Notes in Informatics


WEWoRC 2005 -Western European Workshop on Research in Cryptology P-74, 123-134 (2005).

Gesellschaft für Informatik, Bonn
2005


Editors

Christopher Wolf, Stefan Lucks, Po-Wah Yau (eds.)


Copyright © Gesellschaft für Informatik, Bonn

Contents

Analysis of simplified variants of SHA-256

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

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 different variants of the message expansion and show that there exist low-weight expanded messages for XOR-linearised variants. C. Wolf, S. Lucks, P.-W. Yau (Eds.): WEWoRC 2005, LNI P-74, pp. 123-134, 2005. c Gesellschaft für Informatik e.V.


Full Text: PDF

Gesellschaft für Informatik, Bonn
ISBN 3-88579-403-9


Last changed 24.01.2012 21:52:38