Finding good differential patterns for attacks on SHA-1

Matusiewicz, Krystian & Pieprzyk, Josef (2006) Finding good differential patterns for attacks on SHA-1. Lecture Notes in Computer Science, 3969, pp. 164-177.

View at publisher

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.

Impact and interest:

4 citations in Scopus
Search Google Scholar™
2 citations in Web of Science®

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

ID Code: 73360
Item Type: Journal Article
Refereed: Yes
Additional Information: Coding and Cryptography : International Workshop, WCC 2005, Bergen, Norway, March 14-18, 2005. Revised Selected Papers
DOI: 10.1007/11779360_14
ISSN: 0302-9743
Divisions: Current > Schools > School of Electrical Engineering & Computer Science
Current > QUT Faculties and Divisions > Science & Engineering Faculty
Deposited On: 08 Jul 2014 02:37
Last Modified: 09 Jul 2014 07:04

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page