Results 1 to 10 of about 28,108,495 (141)
Finding Collisions in the Full SHA-1 [PDF]
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.
Xiaoyun Wang
exaly +4 more sources
The First Collision for Full SHA-1 [PDF]
SHA-1 is a widely used 1995 NIST cryptographic hash function standard that was officially deprecated by NIST in 2011 due to fundamental security weaknesses demonstrated in various analyses and theoretical attacks.
M. Stevens +4 more
semanticscholar +6 more sources
SHA-1 and the Strict Avalanche Criterion [PDF]
The Strict Avalanche Criterion (SAC) is a measure of both confusion and diffusion, which are key properties of a cryptographic hash function. This work provides a working definition of the SAC, describes an experimental methodology that can be used to ...
Y. Motara, Barry V W Irwin
semanticscholar +5 more sources
Exploiting an HMAC-SHA-1 Optimization to Speed up PBKDF2 [PDF]
PBKDF2 [1] is a well-known password-based key derivation function. In order to slow attackers down, PBKDF2 introduces CPU-intensive operations based on an iterated pseudorandom function (in our case HMAC-SHA-1).
A. Visconti, F. Gorla
semanticscholar +4 more sources
Freestart Collision for Full SHA-1 [PDF]
This article presents an explicit freestart colliding pair for SHA-1, i.e. a collision for its internal compression function. This is the first practical break of the full SHA-1, reaching all 80 out of 80 steps. Only 10 days of computation on a 64-GPU cluster were necessary to perform this attack, for a runtime cost equivalent to approximately 2^{57.5}
M. Stevens, Pierre Karpman, T. Peyrin
semanticscholar +2 more sources
Hashes are used to check the integrity of data. This paper modified SHA-1 by incorporating mixing method in every round for better diffusion. The modification increased the hash output to 192-bits.
R. L. Quilala +2 more
semanticscholar +4 more sources
In this paper, we propose the parallel architecture for high speed calculations of SHA-1, a widely used cryptographic hash function. Parallel SHA-1 consists of a number of base modules which process the message digest in parallel manner.
Hu-ung Lee +3 more
semanticscholar +4 more sources
From Collisions to Chosen-Prefix Collisions - Application to Full SHA-1 [PDF]
A chosen-prefix collision attack is a stronger variant of a collision attack, where an arbitrary pair of challenge prefixes are turned into a collision.
G. Leurent, T. Peyrin
semanticscholar +3 more sources
Temporins are anti-microbial peptides synthesized in the skin of frogs of the Ranidae family. The few studies to date that have examined their anti-viral properties have shown that they have potential as anti-viral therapies.
Alexia DAMOUR +2 more
exaly +3 more sources
Improved Quantum Cryptanalysis of MD5 and SHA-1
MD5 and SHA-1 are widely studied hash functions in cryptanalysis, owing to their well-structured round functions and historical significance in cryptography.
Kyungbae Jang +2 more
doaj +3 more sources

