Results 171 to 180 of about 213,570 (202)
Finding Preimages in Full MD5 Faster Than Exhaustive Search [PDF]
Lecture Notes in Computer Science, 2009 . In this paper, we present the first cryptographic preimage attack on the full MD5 hash function. This attack, with a complexity of 2116.9, generates a pseudo-preimage of MD5 and, with a complexity of 2123.4, generates a preimage of MD5.
Yu Sasaki, Kazumaro Aoki, Sasaki Yu
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2010 Second International Conference on Multimedia and Information Technology, 2010
This paper describes the MD5 algorithm. It analyses the theories from program codes and sums up some current crack approaches of this algorithm. According to these crack ways, the paper brings forward the corresponding measures for improvement and adopts procedures to achieve a project to prove its ...
Zhao Yong-Xia, Zhen Ge
openaire +1 more source
This paper describes the MD5 algorithm. It analyses the theories from program codes and sums up some current crack approaches of this algorithm. According to these crack ways, the paper brings forward the corresponding measures for improvement and adopts procedures to achieve a project to prove its ...
Zhao Yong-Xia, Zhen Ge
openaire +1 more source
Quantum Implementation of MD5. [PDF]
IACR Cryptol. ePrint Arch.Quantum attacks such as Grover’s algorithm reduce the security of classical hash functions such as MD5. In this paper, we present an efficient quantum circuit for the MD5 hash function and apply Grover’s algorithm to perform an effective pre-image attack.
Sangmin Cha +3 more
openaire +3 more sources
2009 Pacific-Asia Conference on Circuits, Communications and Systems, 2009
This paper proposes one kind of MD5-based error-detecting mechanism. The 128-bit MD5 code is compressed into 16-bit error-detecting code in order to substitute for that computed with CRC or checksum. In this mechanism, computer-simulating technology is used to simulate natural and manual attacks.
Hu Ming, Wang Yan
openaire +1 more source
This paper proposes one kind of MD5-based error-detecting mechanism. The 128-bit MD5 code is compressed into 16-bit error-detecting code in order to substitute for that computed with CRC or checksum. In this mechanism, computer-simulating technology is used to simulate natural and manual attacks.
Hu Ming, Wang Yan
openaire +1 more source
Collisions of MMO-MD5 and Their Impact on Original MD5
2011In this paper, we find collisions of MD5 in the Matyas-Meyer-Oseas mode and Miyaguchi-Preneel mode with a complexity of 239 operations, which runs contrary to the cryptographer's belief that these modes are stronger against collision attacks than the Davies-Meyer mode due to the impossibility of the message modification.
openaire +1 more source
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
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 +3 more sources
2009 International Conference on Networks Security, Wireless Communications and Trusted Computing, 2009
In 2005, collision resistance of several hash functions was broken by Wang et al. The strategy of determining message differential is the most important part of collision attacks against hash functions. So far, there are only three other message differentials attack published, one of which is 6 bits difference and two are 1 bit difference.
Wang Yu, Chen Jianhua, He Debiao
openaire +1 more source
In 2005, collision resistance of several hash functions was broken by Wang et al. The strategy of determining message differential is the most important part of collision attacks against hash functions. So far, there are only three other message differentials attack published, one of which is 6 bits difference and two are 1 bit difference.
Wang Yu, Chen Jianhua, He Debiao
openaire +1 more source
An Improved Collision Attack on MD5 Algorithm
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 ...
Shiwei Chen, Chenhui Jin
openaire +1 more source
Preimage Attacks on Step-Reduced MD5
2008In this paper, we propose preimage attacks on step-reduced MD5. We show that a preimage of a 44-step MD5 can be computed to a complexity of 296. We also consider a preimage attack against variants of MD5 where the round order is modified from the real MD5.
Yu Sasaki 0001, Kazumaro Aoki
openaire +1 more source