Finding collisions in the full SHA-1
Xiaoyun Wang,Yiqun Lisa Yin,Hongbo Yu +2 more
- pp 17-36
Reads0
Chats0
TLDR
This is the first attack on the full 80-step SHA-1 with complexity less than the 280 theoretical bound, and it is shown that collisions ofSHA-1 can be found with complexityLess than 269 hash operations.Abstract:
In this paper, we present new collision search attacks on the hash function SHA-1. We show that collisions of SHA-1 can be found with complexity less than 269 hash operations. This is the first attack on the full 80-step SHA-1 with complexity less than the 280 theoretical bound.read more
Citations
More filters
Proceedings ArticleDOI
Evaluation of security methods for ensuring the integrity of digital evidence
TL;DR: The work presented deals with the evaluation of these security methods in order to study and understand their “goodness” and suitability to protect the integrity of the digital evidence.
Posted Content
Non-Linear Reduced Round Attacks Against SHA-2 Hash family.
TL;DR: Nikolic and Biryukov as discussed by the authors presented a generalized nonlinear local collision which accepts an arbitrary initial message difference and showed that this local collision succeeds with probability 1, which is the best known result.
Patent
Apparatus and method for skein hashing
TL;DR: In this article, an apparatus and method for Skein hashing is described, which consists of a block cipher operable to receive an input data and to generate a hashed output data by applying Unique Block Iteration (UBI) modes, the block cipher comprising at least two mix and permute logic units which are pipelined by registers.
Journal Article
Efficient Negative Databases from Cryptographic Hash Functions
TL;DR: In this paper, the security of negative databases has been shown to be reducible to the hardness of the Discrete-Logarithm problem, which is proved to be the case for negative databases with O(m) storage and linear query time.
Proceedings ArticleDOI
SyMon: Defending large structured P2P systems against Sybil attack
TL;DR: This paper proposes a novel solution that enables all honest peers to protect themselves from sybils with high probability in large structured P2P systems and shows the effectiveness of the proposed system in defending against Sybil attack both analytically and experimentally.
References
More filters
Book ChapterDOI
How to break MD5 and other hash functions
Xiaoyun Wang,Hongbo Yu +1 more
TL;DR: A new powerful attack on MD5 is presented, which unlike most differential attacks, does not use the exclusive-or as a measure of difference, but instead uses modular integer subtraction as the measure.
Journal Article
Advances in Cryptology - EUROCRYPT 2005: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques
TL;DR: This paper discusses Cryptography in High Dimensional Tori, a Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers, and reducing Complexity Assumptions for Statistically-Hiding Commitment.
BookDOI
Advances in Cryptology – CRYPTO 2004
TL;DR: A formal statistical framework for block cipher attacks based on this technique is developed and explicit and compact gain formulas for generalized versions of Matsui’s Algorithm 1 and Algorithm 2 are derived.