462 Hits in 3.0 sec

Cryptanalyzing of Message Digest Algorithms MD4 and MD5

Md. Alam Hossain
2012 International Journal on Cryptography and Information Security  
The message digest algorithms MD4, MD5 have been discussed in detail. A new method has been introduced for obtaining collisions for reduced number of rounds of MD4 and MD5 algorithms.  ...  The time complexity, performance and attacks of MD4 and MD5 algorithm have been computed using this method. The strength has been computed on change in message; the new method can prove its strength.  ...  In [6, 7] , Dobbertin published the collision attack on MD4, and also collisions in compressions function of MD5.  ... 
doi:10.5121/ijcis.2012.2101 fatcat:tk2ciolezncqvgtdsbnhs6mczi

Practical key-recovery attack against APOP, an MD5-based challenge-response authentication

Gaetan Leurent
2008 International Journal of Applied Cryptography  
At EUROCRYPT '05 and CRYPTO '05, Wang et al. described a new class of attacks on most of the hash functions of the MD4 family, MD4, MD5, HAVAL, RIPEMD, SHA-0 and SHA-1 in [26, 28, 29, 27] , which allows  ...  Therefore, an attacker can choose a prefix and a suffix, but he must somehow hide the colliding blocks (1 block in MD4 and SHA-0, and 2 blocks in MD5 and SHA-1).  ...  Finally, we would like to thank Yu Sasaki for the explanations of his improvements over the APOP attack.  ... 
doi:10.1504/ijact.2008.017049 fatcat:tchulg6g4vewhfatm3p3gykhza

RETRACTED: Complexity of Generating Multi-collisions for MD4 and MD5

Wei Gong, Yang Liu, Lei Pan
2012 Physics Procedia  
There are several studies of complexity for simple collisions for MD4 and MD5 in the past.  ...  In this paper, I will change the generators of simple collision generators to generators of multi-collisions and tell the results of generating multi-collisions for MD4 and MD5.  ...  Based on this attack method, Patrick Stach implemented an MD4 collision generator and made its sources available.  ... 
doi:10.1016/j.phpro.2012.03.171 fatcat:eggdw6il3jgijj6uc52yjhp4mu

Applications of SAT Solvers to Cryptanalysis of Hash Functions [chapter]

Ilya Mironov, Lintao Zhang
2006 Lecture Notes in Computer Science  
In particular, we are able to generate full collisions for MD4 and MD5 given only the differential path and applying a (minimally modified) off-the-shelf SAT solver.  ...  We expect SAT solvers to find new applications as a validation and testing tool of practicing cryptanalysts.  ...  A new and improved attack on MD4 [WLF + 05], collisions for MD5 and SHA-0 [WY05, WYY05b] , and a theoretical attack on SHA-1 [WYY05a] were announced by a group of Chinese researchers led by Xiaoyun  ... 
doi:10.1007/11814948_13 fatcat:gyl6sxhjxvhbti56tx2l77fxte

Forgery and Partial Key-Recovery Attacks on HMAC and NMAC Using Hash Collisions [chapter]

Scott Contini, Yiqun Lisa Yin
2006 Lecture Notes in Computer Science  
We present distinguishing, forgery, and partial key recovery attacks on HMAC and NMAC using collisions of MD4, MD5, SHA-0, and reduced SHA-1.  ...  In this paper, we analyze the security of HMAC and NMAC, both of which are hash-based message authentication codes.  ...  We thank Mihir Bellare and Hugo Krawczyk for valuable suggestions on an early draft of this work. We thank Eli Biham for enlightening discussions.  ... 
doi:10.1007/11935230_3 fatcat:opfus47hrvcqzbt6aqiasohgme

RIPEMD-160: A strengthened version of RIPEMD [chapter]

Hans Dobbertin, Antoon Bosselaers, Bart Preneel
1996 Lecture Notes in Computer Science  
Cryptographic hash functions are an important tool in cryptography for applications such as digital fingerprinting of messages, message authentication, and key derivation.  ...  During the last five years, several fast software hash functions have been proposed; most of them are based on the design principles of Ron Rivest's MD4.  ...  Acknowledgments We would like to thank Bert den Boer, Markus Dichtl, Walter Fumy, and Peter Landrock for encouragement and advice, and Chris Mitchell, Xuejia Lai, and Wei Dai for helpful comments on earlier  ... 
doi:10.1007/3-540-60865-6_44 fatcat:rgwdlj4wvbhvvgz3aiced77o2y

On the Security of HMAC and NMAC Based on HAVAL, MD4, MD5, SHA-0 and SHA-1 (Extended Abstract) [chapter]

Jongsung Kim, Alex Biryukov, Bart Preneel, Seokhie Hong
2006 Lecture Notes in Computer Science  
Our distinguishing and forgery attacks can also be mounted on NMAC based on HAVAL, MD4, MD5, SHA-0 and SHA-1.  ...  In this paper we devise two new distinguishers of the structure of HMAC, called differential and rectangle distinguishers, and use them to discuss the security of HMAC based on HAVAL, MD4, MD5, SHA-0 and  ...  on HAVAL, MD4, MD5, SHA-0 and SHA-1 ).  ... 
doi:10.1007/11832072_17 fatcat:tpcbtjkrubalbkwei2ap2kzpiy

Enhancing the Security Level of SHA-1 by Replacing the MD Paradigm

Harshvardhan Tiwari, Krishna Asawa
2013 Journal of Computing and Information Technology  
All the MD4 design based hash functions such as MD5, SHA-0, SHA-1 and RIPEMD-160 are built on Merkle-Damgård iterative method.  ...  It is shown that the proposed hash function has high sensitivity to an input message and is secure against different cryptanalytic attacks.  ...  In [15] , authors found pseudo-collision for MD5. Dobbertin [16] published an attack that found a collision in MD5.  ... 
doi:10.2498/cit.1002181 fatcat:zwgk2nm5indcxblvgbql42tcnu

Cryptanalysis of the Hash Functions MD4 and RIPEMD [chapter]

Xiaoyun Wang, Xuejia Lai, Dengguo Feng, Hui Chen, Xiuyuan Yu
2005 Lecture Notes in Computer Science  
In this paper, we present a new attack on MD4 which can find a collision with probability 2 −2 to 2 −6 , and the complexity of finding a collision doesn't exceed 2 8 MD4 hash operations.  ...  Built upon the collision search attack, we present a chosen-message pre-image attack on MD4 with complexity below 2 8 .  ...  Acknowledgements It is a pleasure to acknowledge Hans Dobbertin, Magnus Daum for their important advice, corrections, and suggestions, and for spending their precious time on our research.  ... 
doi:10.1007/11426639_1 fatcat:nc4f7czj6bc3boj2xgubx5rq2a

Preimage Attacks on One-Block MD4, 63-Step MD5 and More [chapter]

Kazumaro Aoki, Yu Sasaki
2009 Lecture Notes in Computer Science  
This paper shows preimage attacks on one-block MD4 and MD5 reduced to 63 (out of 64) steps.  ...  A preimage of one-block MD4 can be computed in the complexity of the 2 107 MD4 compression function computation, and a preimage of MD5 reduced to 63 steps can be computed in the complexity of the 2 121  ...  Acknowledgments The authors wish to thank Christophe De Cannière and Christian Rechberger for providing [2] and anonymous referees for many useful comments on this paper.  ... 
doi:10.1007/978-3-642-04159-4_7 fatcat:4cdm4qbdore4vjxxhp3dhzoioi

Design of New Hash Algorithm with Integration of Key based on the Review of Standard Hash Algorithms

Nidhi Garg, Neeta Wadhwa
2014 International Journal of Computer Applications  
This paper presents comparative study of standard hash algorithms (MD5, SHA-1 and SHA-2), their security aspects and recent attacks.  ...  These functions have many information security applications such as Digital Signatures, Message Authentication, Data Integrity and Key derivation.  ...  ) Attacks on MD5 In 1993, B.  ... 
doi:10.5120/17544-8128 fatcat:mbib4y5jq5gpnmqot3jgf7li4u

Cryptanalysis on HMAC/NMAC-MD5 and MD5-MAC [chapter]

Xiaoyun Wang, Hongbo Yu, Wei Wang, Haina Zhang, Tao Zhan
2009 Lecture Notes in Computer Science  
Furthermore, we give distinguishing and partial key recovery attacks on MDx-MAC based on MD5.  ...  In this paper, we present the first distinguishing attack on HMAC and NMAC based on MD5 without related keys, which distinguishes the HMAC/NMAC-MD5 from HMAC/NMAC with a random function.  ...  We would like to thank Christian Rechberger and three reviewers for their very helpful comments on the paper.  ... 
doi:10.1007/978-3-642-01001-9_7 fatcat:oo43nyxurfag7aexq54gt6cw7m

A New Hash Function Based On The Hybrid Of Existing Message Digest Algorithms

2019 International Journal of Engineering and Advanced Technology  
In this paper, authors aim to reexplore message digest algorithms then proposes a new hash function was developed to combine the optimized internal strength elements of the algorithms, namely MD5 and SHA  ...  The proposed new hash function has been evaluated and the results shown that its execution time are slightly shorter than the combination of (SHA-192+MD5) but almost as fast as with the combination of  ...  Initially, MD5 was thought to be difficult to find collisions, but there were some successful attacks that find the collisions, such as the attacks by Marc Steven and Kuznetsov [8] , [9] , so that MD5  ... 
doi:10.35940/ijeat.e1207.0585c19 fatcat:jux3ph7ydvbajgd4kp3vimuyri

How to Break MD5 and Other Hash Functions [chapter]

Xiaoyun Wang, Hongbo Yu
2005 Lecture Notes in Computer Science  
In this paper we present a new powerful attack on MD5 which allows us to find collisions efficiently. We used this attack to find collisions of MD5 in about 15 minutes up to an hour computation time.  ...  MD5 is one of the most widely used cryptographic hash functions nowadays. It was designed in 1992 as an improvement of MD4, and its security was widely studied since then by several authors.  ...  Yao, and Yiqun Lisa Yin for their important advice, corrections, and suggestions, and for spending their precious time on our research.  ... 
doi:10.1007/11426639_2 fatcat:a4opm7g24jhjpguelj7xmpdgcm

Boomerang Distinguishers on MD4-Family: First Practical Results on Full 5-Pass HAVAL [chapter]

Yu Sasaki
2012 Lecture Notes in Computer Science  
Our attacks are implemented on a PC and we present a generated 4-sum quartet for each attack target.  ...  We also point out that the 4-sum distinguisher can also be constructed for other MD4-based hash functions such as MD5, 3-pass HAVAL, and 4-pass HAVAL.  ...  We then constructed the new path and proposed the 4-sum distinguisher on the compression function with a complexity of approximately 2 11 computations.  ... 
doi:10.1007/978-3-642-28496-0_1 fatcat:7yi6amv7hffyhbeppuzgcjdwou
« Previous Showing results 1 — 15 out of 462 results