Krystian Matusiewicz, Josef Pieprzyk  Home/Search
Context
Related
| iacr.org/2004/364.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/2004/ (more) Homepages: K.Matusiewicz |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we describe a method of finding di#erential patterns that may be used to attack reduced versions of SHA-1. We show that the problem of finding optimal di#erential patterns for SHA-1 is equivalent to the problem of finding minimal weight codeword in a linear code. Finally, we present a number of patterns of di#erent lengths suitable for finding collisions and near-collisions and discuss some bounds on minimal weights of them. (Update)
Active bibliography (related documents): More All
1.0: The Mundja Streaming MAC - Philip Hawkes Michael (2004) (Correct)
0.5: Herding Hash Functions and the Nostradamus Attack - Kelsey, Kohno (2006) (Correct)
0.2: Collision-Resistant Usage of MD5 and SHA-1 via Message.. - Szydlo, Yin (2005) (Correct)
Similar documents based on text: More All
0.2: Cheating Immune Secret Sharing - Zhang, Pieprzyk (2001) (Correct)
0.2: Fail-Stop Threshold Signature Schemes based on Elliptic.. - Susilo, Safavi-Naini.. (1999) (Correct)
0.2: Codes Identifying Bad Signatures in Batches - Pastuszak, Pieprzyk, Seberry (Correct)
BibTeX entry: (Update)
@misc{ matusiewicz-finding,
author = "Krystian Matusiewicz and Josef Pieprzyk",
title = "Finding Good Dierential Patterns for Attacks on {SHA-1}",
howpublished = "IACR Cryptology ePrint Archive, report 2004/364",
url = "citeseer.ist.psu.edu/matusiewicz04finding.html" }
Citations (may not include all citations):401 The MD4 message digest algorithm (context) - Rivest - 1991
105 Secure hash standard (context) - of, Technology - 2002
72 National Institute of Standards and Technology (context) - Secure, SHS - 1993
58 Internet Engineering Task Force (context) - Rivest, message et al. - 1992
58 Internet Engineering Task Force (context) - Rivest, message et al. - 1992
20 Haval -- a one-way hashing algorithm with variable length of.. - Zheng, Pieprzyk - 1993
18 The intractability of computing the minimum distance of a co.. (context) - Vardy - 1997
17 erential collisions in SHA (context) - Chabaud, Joux - 1998
16 The status of MD5 after a recent attack (context) - Dobbertin - 1996
15 Integrity Primitives for Secure Information Systems (context) - Bosselaers, Preneel - 1995
13 An attack of the last two rounds of MD - den Boer, Bosselaers - 1991
11 the security of some cryptosystems based on error-correcting.. - Chabaud - 1995
11 Near collisions of SHA - Biham, Chen - 2004
10 Journal of Cryptology (context) - Dobbertin, MD - 1998
10 A new algorithm for finding minimum-weight words in a linear.. - Canteaut, Chabaud - 1998
10 Collisions for hash functions MD (context) - Wang, Lai et al. - 2004
10 RIPEMD with two-round compress function is not collison free (context) - Dobbertin - 1997
9 A probabilistic algorithm for computing minimum weights of l.. (context) - Leon - 1988
2 Short talk presented at CRYPTO'04 Rump Session (context) - Biham, Chen et al. - 2004
2 Short talk presented at CRYPTO'04 Rump Session (context) - Joux, SHA- - 2004
1 Short talk presented at CRYPTO'04 Rump Session (context) - Wang, Lai et al. - 2004
1 crypt newsgroup message (context) - Lemuet, SHA- - 2004
1 Cryptanalysis of 3pass HAVAL (context) - Van Rompay, Biryukov et al. - 2003
Documents on the same site (http://eprint.iacr.org/2004/): More
The Security and Efficiency of Micciancio's Cryptosystem - Ludwig (2004) (Correct)
Entropic Security and the Encryption of High Entropy Messages - Dodis, Smith (2004) (Correct)
On Cheating Immune Secret Sharing - Braeken, Nikova, al. (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC