scispace - formally typeset
Search or ask a question
Topic

Collision attack

About: Collision attack is a research topic. Over the lifetime, 1093 publications have been published within this topic receiving 28389 citations.


Papers
More filters
Book ChapterDOI
14 Dec 1994
TL;DR: In this article, an improvement of the differential attack on hash functions based on block ciphers is presented, which greatly reduces the work factor to find a pair that follows the characteristic.
Abstract: In this paper we present an improvement of the differential attack on hash functions based on block ciphers. By using the specific properties of the collision attack on hash functions, we can greatly reduce the work factor to find a pair that follows the characteristic. We propose a new family of differential characteristics that is especially useful in combination with our improvement. Attacks on a hash function based on DES variants reduced to 12, 13 or 15 rounds become faster than brute force collision attacks.

19 citations

Proceedings ArticleDOI
D. Lee1
16 Oct 2007
TL;DR: It is shown that each hash function has a vulnerability index that measures its inherent vulnerability against hash chains attacks, and that this index is invariant with respect to different types of hash chain attacks using probabilistic algorithms with or without an oracle.
Abstract: A hash chain is constructed by repeated hashing from an initial value. While it finds applications for network protocol design it also poses threats to hash function one-way and collision-free properties. We investigate the complexity of breaking hash function security properties by hash chain attacks using probabilistic algorithms. We show that each hash function has a vulnerability index that measures its inherent vulnerability against hash chains attacks. The vulnerability index is invariant with respect to different types of hash chain attacks using probabilistic algorithms with or without an oracle. It provides a criterion for the evaluation of the prevalent hash functions and also be used as a guide for the design of new hash functions. We analyze the properties of the vulnerability indices and estimate their values of the commonly used hash functions: MD5, SHA1, RIPEMD128 and RIPEMD160. Preliminary experiments indicate that their vulnerability indices are rather low; that is, it is hard to break their security properties by hash chain attacks with probabilistic algorithms.

19 citations

Book ChapterDOI
06 Mar 2013
TL;DR: This paper addresses the problem of heterogeneous leakage pointed out by Gerard and Standaert by inserting an efficient termination algorithm in the key-recovery phase of the collision-correlation attack, and shows the superiority of 2nd-order CPA when its leakage model is not too far from the real leakage function.
Abstract: In this paper we study the collision-correlation attack published by Clavier etal. at CHES 2011 on a 1st-order Boolean masking scheme and show its lack of robustness against unknown and high level of measurement noise. In order to improve the attack, we follow the approach that Gerard and Standaert proposed in a recent paper at CHES 2012. Then we address the problem of heterogeneous leakage pointed out by Gerard and Standaert (when the leakage noise is different from one Sbox output to the others due for instance to implementation particularities or resynchronisation reasons), by inserting an efficient termination algorithm in the key-recovery phase of the attack. In a last contribution, we compare (over simulations and real experiments) the enhanced collision-correlation attack and the 2nd-order CPA attack. Similarly to the results of Gerard and Standaert, we show - in the context of masked implementations - the superiority of 2nd-order CPA when its leakage model is not too far from the real leakage function.

19 citations

Proceedings ArticleDOI
28 Sep 2009
TL;DR: This work uses pre-shared secret key which is obtained from Elliptic Curve Diffie Hellmann (ECDH) key exchange algorithm, and is based on modified SHA-1 hash function which helps to compute message authentication code for given messages.
Abstract: In this work, we propose simple hash based message authentication and integrity code algorithm for wireless sensor networks. The proposed scheme uses pre-shared secret key which is obtained from Elliptic Curve Diffie Hellmann (ECDH) key exchange algorithm, and is based on modified SHA-1 (mSHA-1) hash function which helps to compute message authentication code for given messages. We suggest two scenarios depending on scale of the network, and also analyze security of the proposed algorithm. This algorithm provides both integrity and authenticity of a message with only one hash value.

19 citations

Journal ArticleDOI
TL;DR: This Letter takes a chaos-based hash function proposed very recently in Amin, Faragallah and Abd El-Latif (2009) as a sample to analyze its computational collision problem, and generalizes the construction method of one kind of chaos- based hash function and summarize some attentions to avoid the collision problem.

19 citations


Network Information
Related Topics (5)
Cryptography
37.3K papers, 854.5K citations
88% related
Public-key cryptography
27.2K papers, 547.7K citations
87% related
Hash function
31.5K papers, 538.5K citations
85% related
Encryption
98.3K papers, 1.4M citations
85% related
Computer security model
18.1K papers, 352.9K citations
82% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202311
202224
202115
202013
201919
201815