Finding good differential patterns for attacks on SHA-1

Krystian Matusiewicz; Josef Pieprzyk

doi:10.1007/11779360_14

Finding good differential patterns for attacks on SHA-1

Krystian Matusiewicz^*, Josef Pieprzyk

^*Corresponding author for this work

School of Computing

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

10 Citations (Scopus)

Abstract

In this paper we analyse properties of the message expansion algorithm of SHA-1 and describe a method of finding differential patterns that may be used to attack reduced versions of SHA-1. We show that the problem of finding optimal differential patterns for SHA-1 is equivalent to the problem of finding minimal weight codeword in a large linear code. Finally, we present a number of patterns of different lengths suitable for finding collisions and near-collisions and discuss some bounds on minimal weights of them.

Original language	English
Title of host publication	Coding and Cryptography - International Workshop, WCC 2005, Revised Selected Papers
Editors	Øyvind Ytrehus
Place of Publication	Berlin; New York
Publisher	Springer, Springer Nature
Pages	164-177
Number of pages	14
Volume	3969 LNCS
ISBN (Electronic)	9783540354826
ISBN (Print)	3540354816, 9783540354819
DOIs	https://doi.org/10.1007/11779360_14
Publication status	Published - 2006
Event	International Workshop on Coding and Cryptography, WCC 2005 - Bergen, Norway Duration: 14 Mar 2005 → 18 Mar 2005

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3969 LNCS
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Other

Other	International Workshop on Coding and Cryptography, WCC 2005
Country/Territory	Norway
City	Bergen
Period	14/03/05 → 18/03/05

Access to Document

10.1007/11779360_14

Cite this

Matusiewicz, K., & Pieprzyk, J. (2006). Finding good differential patterns for attacks on SHA-1. In Ø. Ytrehus (Ed.), Coding and Cryptography - International Workshop, WCC 2005, Revised Selected Papers (Vol. 3969 LNCS, pp. 164-177). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3969 LNCS). Springer, Springer Nature. https://doi.org/10.1007/11779360_14

Matusiewicz, Krystian ; Pieprzyk, Josef. / Finding good differential patterns for attacks on SHA-1. Coding and Cryptography - International Workshop, WCC 2005, Revised Selected Papers. editor / Øyvind Ytrehus. Vol. 3969 LNCS Berlin; New York : Springer, Springer Nature, 2006. pp. 164-177 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{24ee1578d92846cda4f801b040f14efa,

title = "Finding good differential patterns for attacks on SHA-1",

abstract = "In this paper we analyse properties of the message expansion algorithm of SHA-1 and describe a method of finding differential patterns that may be used to attack reduced versions of SHA-1. We show that the problem of finding optimal differential patterns for SHA-1 is equivalent to the problem of finding minimal weight codeword in a large linear code. Finally, we present a number of patterns of different lengths suitable for finding collisions and near-collisions and discuss some bounds on minimal weights of them.",

author = "Krystian Matusiewicz and Josef Pieprzyk",

year = "2006",

doi = "10.1007/11779360_14",

language = "English",

isbn = "3540354816",

volume = "3969 LNCS",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer, Springer Nature",

pages = "164--177",

editor = "{\O}yvind Ytrehus",

booktitle = "Coding and Cryptography - International Workshop, WCC 2005, Revised Selected Papers",

address = "United States",

note = "International Workshop on Coding and Cryptography, WCC 2005 ; Conference date: 14-03-2005 Through 18-03-2005",

}

Matusiewicz, K & Pieprzyk, J 2006, Finding good differential patterns for attacks on SHA-1. in Ø Ytrehus (ed.), Coding and Cryptography - International Workshop, WCC 2005, Revised Selected Papers. vol. 3969 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3969 LNCS, Springer, Springer Nature, Berlin; New York, pp. 164-177, International Workshop on Coding and Cryptography, WCC 2005, Bergen, Norway, 14/03/05. https://doi.org/10.1007/11779360_14

Finding good differential patterns for attacks on SHA-1. / Matusiewicz, Krystian; Pieprzyk, Josef.
Coding and Cryptography - International Workshop, WCC 2005, Revised Selected Papers. ed. / Øyvind Ytrehus. Vol. 3969 LNCS Berlin; New York: Springer, Springer Nature, 2006. p. 164-177 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3969 LNCS).

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

TY - GEN

T1 - Finding good differential patterns for attacks on SHA-1

AU - Matusiewicz, Krystian

AU - Pieprzyk, Josef

PY - 2006

Y1 - 2006

N2 - In this paper we analyse properties of the message expansion algorithm of SHA-1 and describe a method of finding differential patterns that may be used to attack reduced versions of SHA-1. We show that the problem of finding optimal differential patterns for SHA-1 is equivalent to the problem of finding minimal weight codeword in a large linear code. Finally, we present a number of patterns of different lengths suitable for finding collisions and near-collisions and discuss some bounds on minimal weights of them.

AB - In this paper we analyse properties of the message expansion algorithm of SHA-1 and describe a method of finding differential patterns that may be used to attack reduced versions of SHA-1. We show that the problem of finding optimal differential patterns for SHA-1 is equivalent to the problem of finding minimal weight codeword in a large linear code. Finally, we present a number of patterns of different lengths suitable for finding collisions and near-collisions and discuss some bounds on minimal weights of them.

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

U2 - 10.1007/11779360_14

DO - 10.1007/11779360_14

M3 - Conference proceeding contribution

AN - SCOPUS:33746700197

SN - 3540354816

SN - 9783540354819

VL - 3969 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 164

EP - 177

BT - Coding and Cryptography - International Workshop, WCC 2005, Revised Selected Papers

A2 - Ytrehus, Øyvind

PB - Springer, Springer Nature

CY - Berlin; New York

T2 - International Workshop on Coding and Cryptography, WCC 2005

Y2 - 14 March 2005 through 18 March 2005

ER -

Matusiewicz K, Pieprzyk J. Finding good differential patterns for attacks on SHA-1. In Ytrehus Ø, editor, Coding and Cryptography - International Workshop, WCC 2005, Revised Selected Papers. Vol. 3969 LNCS. Berlin; New York: Springer, Springer Nature. 2006. p. 164-177. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11779360_14

Finding good differential patterns for attacks on SHA-1

Abstract

Publication series

Other

Access to Document

Other files and links

Fingerprint

Cite this