Results 251 to 260 of about 12,998 (288)
Some of the next articles are maybe not open access.
IEEE Transactions on Information Forensics and Security, 2019
Key enumeration schemes are used to post-process the scores given by side channel distinguishers and enumerate the key candidates from the most possible one to the least possible one, which can be regarded as optimal tools of key search. However, the application of them is limited by very large key candidate space and computing power consumption.
Changhai Ou, Zhu Wang, Degang Sun
exaly +2 more sources
Key enumeration schemes are used to post-process the scores given by side channel distinguishers and enumerate the key candidates from the most possible one to the least possible one, which can be regarded as optimal tools of key search. However, the application of them is limited by very large key candidate space and computing power consumption.
Changhai Ou, Zhu Wang, Degang Sun
exaly +2 more sources
An Improved Collision Attack on MD5 Algorithm
Lecture Notes in Computer Science, 2008The research on the attack algorithm for a MD5 collision is one of the focuses in cryptology nowadays. In this paper, by analyzing the properties of the nonlinear Boolean functions used in MD5 and the differences in term of XOR and subtraction modulo 232, we prove that some sufficient conditions presented by Jie Liang and Xuejia Lai are also necessary ...
Chenhui Jin, Chen Shiwei, Jin Chenhui
exaly +2 more sources
Collision Attack for the Hash Function Extended MD4
, 2011 Extended MD4 is a hash function proposed by Rivest in 1990 with a 256-bit hash value. The compression function consists of two different and independent parallel lines called Left Line and Right Line, and each line has 48 steps. The initial values of Left Line and Right Line are denoted by IV0 and IV1 respectively. Dobbertin proposed a collision attack
Wang Gaoli, Gaoli Wang
openaire +2 more sources
Fast Collision Attack on MD5. [PDF]
IACR Cryptol. ePrint Arch., 2013 We presented the first single block collision attack on MD5 with complexity of $2^{47}$ MD5 compressions and posted the challenge for another completely new one in 2010.
Tao Xie, Fanbao Liu, Dengguo Feng
openaire +2 more sources
Journal of Cryptology, 2014
Hash functions have been among the most scrutinized cryptographic primitives in the previous decade, mainly due to the cryptanalysis breakthroughs on MD-SHAfamily and the NIST SHA-3 competition that followed. Grindahl is a hash function proposed at FSE 2007 that inspired several SHA-3 candidates.
openaire +2 more sources
Hash functions have been among the most scrutinized cryptographic primitives in the previous decade, mainly due to the cryptanalysis breakthroughs on MD-SHAfamily and the NIST SHA-3 competition that followed. Grindahl is a hash function proposed at FSE 2007 that inspired several SHA-3 candidates.
openaire +2 more sources
Improved Collision Attack on MD4. [PDF]
IACR Cryptol. ePrint Arch., 2005 In this paper, we propose an attack method to find collisions of MD4 hash function. This attack is the improved version of the attack which was invented by Xiaoyun Wang et al [1]. We were able to find collisions with probability almost 1, and the average
Yusuke Naito 0001 +3 more
openaire +2 more sources
Improved Collision Attacks on MD4 and MD5
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2007At Eurocrypt'05, Wang et al. presented efficient collision attacks on MD5 and MD4 hash functions. They found a collision of MD5 with a complexity of less than 237 MD5 hash operations, and a collision of MD4 with complexity less than 28 MD4 hash operations. In their attack, the procedure to generate a collision is divided into 4 steps.
Yu Sasaki 0001 +3 more
openaire +1 more source
Improved Collision Attack on MD5. [PDF]
IACR Cryptol. ePrint Arch., 2005 In EUROCRYPT2005, a collision attack on MD5 was proposed by Wang et al. In this attack, conditions which are sufficient to generate collisions (called "sufficient condition") are introduced.
Yu Sasaki 0001 +3 more
openaire +2 more sources
Meet-in-the-Middle Attacks Revisited: Key-Recovery, Collision, and Preimage Attacks
2021At EUROCRYPT 2021, Bao et al. proposed an automatic method for systematically exploring the configuration space of meet-in-the-middle (MITM) preimage attacks. We further extend it into a constraint-based framework for finding exploitable MITM characteristics in the context of key-recovery and collision attacks by taking the subtle peculiarities of both
Xiaoyang Dong 0001 +5 more
openaire +1 more source
Fault Based Collision Attacks on AES
2006In this paper we present a new class of collision attacks that are based on inducing faults into the encryption process. We combine the classical fault attack of Biham and Shamir with the concept of collision attacks of Schramm et al. Unlike previous fault attacks by Blomer and Seifert our new attacks only need bit flips not bit resets.
Johannes Blömer, Volker Krummel
openaire +1 more source