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 published on a yearly basis
Papers
More filters
•
TL;DR: A method is given that appears to be able to find colliding messages for the Waterfall hash function with approximately O(2) work for all hash sizes, which would show that the Waterfalls hash function does not meet the required collision resistance.
Abstract: We give a method that appears to be able to find colliding messages for the Waterfall hash function with approximately O(2) work for all hash sizes. If correct, this would show that the Waterfall hash function does not meet the required collision resistance.
3 citations
••
TL;DR: This work improves upon previous results by utilising three ideas which were not used in previous works on collision attacks against SHA-3, and proposes an efficient deduce-and-sieve algorithm on the basis of two new non-random properties of the Keccak non-linear layer.
Abstract: The Keccak sponge function family, designed by Bertoni et al. in 2007, was selected by the U.S. National Institute of Standards and Technology (NIST) in 2012 as the next generation of Secure Hash Algorithm (SHA-3). Due to its theoretical and practical importance, cryptanalysis of SHA-3 has attracted a lot of attention. Currently, the most powerful collision attack on SHA-3 is Jian Guo et al.’s linearisation technique. However, this technique is infeasible for variants with asmaller input space, such as SHA-3-384.In this work we improve upon previous results by utilising three ideas which were not used in previous works on collision attacks against SHA-3. First, we use 2-block messages instead of 1-block messages, to reduce constraints and increase flexibility in our solutions. Second, we reduce the connectivity problem into a satisfiability (SAT) problem, instead of applying the linearisation technique. Finally, we propose an efficient deduce-and-sieve algorithm on the basis of two new non-random propertiesof the Keccak non-linear layer.The resulting collision-finding algorithm on 4-round SHA-3-384 has a practical time complexity of 259.64 (and a memory complexity of 245.94). This greatly improves upon the best known collision attack so far: Dinur et al. achieved an impractical 2147 time complexity. Our attack does not threaten the security margin of the SHA-3 hash function. However, the tools developed in this paper could be used to analyse other cryptographic primitives as well as to develop new and faster SAT solvers.
3 citations
••
28 Dec 2009TL;DR: The paper puts forward the Plan for Threshold Identity Authentication that is based on partial Hash table without credibility center that can effectively resist the external attack and passive attack from internal nodes, and thus improve the efficiency of various nodes for certificate inquiry and updating.
Abstract: To set up various kinds of application system on moving Ad Hoc network, an effective mechanism for security assurance has to be provided. The paper puts forward the Plan for Threshold Identity Authentication that is based on partial Hash table without credibility center. The plan can effectively resist the external attack and passive attack from internal nodes, and thus improve the efficiency of various nodes for certificate inquiry and updating. Compared with currently existing plans for identity authentication, the paper has a smaller quantity of calculation and a lower degree of complexity with fast generation of certificates. Keywords-Ad Hoc network;Hash table;public key Certificate; Threshold Identity Authentication� �� . Overview
3 citations
•
28 Sep 2010
TL;DR: This thesis reviews the analysis done by Kelsey and Kohno of CTFP resistance and proposes a correction of their analysis and a revised analysis that calculates the message complexity and the computational complexity of the generic attacks that are based on the diamond structure.
Abstract: The subject of this thesis is a security property of hash functions, called chosen-targetforced-prefix preimage (CTFP) resistance and the generic attack on this property, called the herding attack. The study of CTFP resistance started when Kelsey-Kohno introduced a new data structure, called a diamond structure, in order to show the strength of a CTFP resistance property of a hash function. In this thesis, we concentrate on the complexity of the diamond structure and its application in the herding attack. We review the analysis done by Kelsey and Kohno and point out a subtle flaw in their analysis. We propose a correction of their analysis and based on our revised analysis, calculate the message complexity and the computational complexity of the generic attacks that are based on the diamond structure. As an application of the diamond structure on generic attacks, we propose a multiple herding attack on a special generalization of iterated hash functions, proposed by Nandi-Stinson.
3 citations
••
TL;DR: This article exploits collision attack to optimize Template Attack (TA), and proposes a Lightweight Collision Detection (LCD) algorithm that exploits a jump detection mechanism to efficiently reduce the repetitive collision detections on chains with the same prefix sub-chains.
Abstract: By introducing collision information into divide-and-conquer attacks, several existing works transform the original candidate space, which may be too large to enumerate, into a significantly smaller collision space, thus making key recovery possible However, the inefficient collision detection algorithms and fault tolerance mechanisms make them time-consuming and their success rate low Moreover, they may still leave very huge chain spaces that makes it difficult for key recovery In this article, we exploit collision attack to optimize Template Attack (TA), and propose a Lightweight Collision Detection (LCD) algorithm The proposed method exploits a jump detection mechanism to efficiently reduce the repetitive collision detections on chains with the same prefix sub-chains We then introduce guessing theory to reorder the collision detection of the sub-keys according to their guessing lengths, and provide us with an evaluation tool Finally, we design a highly efficient fault tolerance mechanism for our LCD to allow flexible thresholds adjustment, and further optimize sieving mechanism to efficiently extract the best chains with the largest number of collisions Experimental results fully demonstrate LCD's superiority
3 citations