Filters








243 Hits in 2.3 sec

On the Collision Resistance of RIPEMD-160 [chapter]

Florian Mendel, Norbert Pramstaller, Christian Rechberger, Vincent Rijmen
2006 Lecture Notes in Computer Science  
To the best of our knowledge this is the first article that investigates the impact of recent advances in cryptanalysis of hash functions on RIPEMD-160.  ...  Furthermore, we present an analytical attack on a round-reduced variant of the RIPEMD-160 hash function.  ...  Based on the similar design of RIPEMD-160, MD5, SHA-1, and its predecessor RIPEMD, one might doubt the security of RIPEMD-160.  ... 
doi:10.1007/11836810_8 fatcat:wqx3ja6vlrdpzi7xepixxuopyi

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

Hans Dobbertin, Antoon Bosselaers, Bart Preneel
1996 Lecture Notes in Computer Science  
Because of recent progress in the cryptanalysis of these hash functions, we propose a new version of RIPEMD with a 160-bit result, as well as a plug-in substitute for RIPEMD with a 128-bit result.  ...  One such proposal was RIPEMD, which was developed in the framework of the EU project RIPE (Race Integrity Primitives Evaluation).  ...  versions of this paper.  ... 
doi:10.1007/3-540-60865-6_44 fatcat:rgwdlj4wvbhvvgz3aiced77o2y

Differential Attacks on Reduced RIPEMD-160 [chapter]

Florian Mendel, Tomislav Nad, Stefan Scherz, Martin Schläffer
2012 Lecture Notes in Computer Science  
In this work, we provide the first security analysis of reduced RIPEMD-160 regarding its collision resistance with practical complexity.  ...  In this paper, we present the first application of the attacks of Wang et al. on MD5 and SHA-1 to RIPEMD-160.  ...  Acknowledgments This work was supported in part by the Research Council KU Leuven: GOA TENSE (GOA/11/007), by the IAP Programme P6/26 BCRYPT of the Belgian State (Belgian Science Policy) and by the European  ... 
doi:10.1007/978-3-642-33383-5_2 fatcat:sbwlw6bzzfbbnkm7etkzpm2lmy

New Semi-Free-Start Collision Attack Framework for Reduced RIPEMD-160

Fukang Liu, Christoph Dobraunig, Florian Mendel, Takanori Isobe, Gaoli Wang, Zhenfu Cao
2019 IACR Transactions on Symmetric Cryptology  
However, for RIPEMD-160, no (semi-free-start) collision attacks on the full number of steps are known.  ...  However, the best known semi-free-start collision attack on 36 steps of RIPEMD-160 presented at Asiacrypt 2017 still requires 255.1 time and 232 memory.  ...  Acknowledgments We thank the anonymous reviewers of ToSC Issue 3 for their many helpful and insightful comments.  ... 
doi:10.46586/tosc.v2019.i3.169-192 fatcat:fjw3c3j3nrbzvfnhty2iwms7te

New Semi-Free-Start Collision Attack Framework for Reduced RIPEMD-160

Fukang Liu, Christoph Dobraunig, Florian Mendel, Takanori Isobe, Gaoli Wang, Zhenfu Cao
2019 IACR Transactions on Symmetric Cryptology  
However, for RIPEMD-160, no (semi-free-start) collision attacks on the full number of steps are known.  ...  However, the best known semi-free-start collision attack on 36 steps of RIPEMD-160 presented at Asiacrypt 2017 still requires 255.1 time and 232 memory.  ...  Acknowledgments We thank the anonymous reviewers of ToSC Issue 3 for their many helpful and insightful comments.  ... 
doi:10.13154/tosc.v2019.i3.169-192 dblp:journals/tosc/LiuDMIWC19 fatcat:bwvo5c5qvvf33gscnpqapugs54

Improved Cryptanalysis of Reduced RIPEMD-160 [chapter]

Florian Mendel, Thomas Peyrin, Martin Schläffer, Lei Wang, Shuang Wu
2013 Lecture Notes in Computer Science  
In this article, we propose an improved cryptanalysis of the double-branch hash function standard RIPEMD-160.  ...  RIPEMD-160 compression function, while the previously best know result reached 36 steps.  ...  The authors would like to thank the anonymous referees for their helpful comments.  ... 
doi:10.1007/978-3-642-42045-0_25 fatcat:h2spjrcc6va7vm7pcf7lhlyvu4

Distinguishers on Double-Branch Compression Function and Applications to Round-Reduced RIPEMD-128 and RIPEMD-160

Yu SASAKI, Lei WANG
2014 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
The partial 2-dimension sum is generated on 48 steps of RIPEMD-128 and 42 steps of RIPEMD-160, with complexities of 2 35 and 2 36 , respectively.  ...  This leads to 4-sum attacks on 47 steps (out of 64 steps) of RIPEMD-128 and 40 steps (out of 80 steps) of RIPEMD-160.  ...  For preimage resistance, the attacks on RIPEMD-128 and RIPEMD-160 reach 36 steps [35] and 31 steps [24] respectively.  ... 
doi:10.1587/transfun.e97.a.177 fatcat:d32lz2bkfrdslh2ht3gmxzbhvm

Cryptanalysis of 48-step RIPEMD-160

Gaoli Wang, Yanzhao Shen, Fukang Liu
2017 IACR Transactions on Symmetric Cryptology  
Moreover, we propose a semi-free-start collision attack on 48-step RIPEMD-160, which improves the best semi-free start collision by 6 rounds.  ...  Then a semi-free-start collision attack on 48-step RIPEMD-160 can be obtained based on the differential path constructed by Mendel et al. at ASIACRYPT 2013.  ...  This work is supported by the National Natural Science Foundation of China (Nos. 61572125,  ... 
doi:10.13154/tosc.v2017.i2.177-202 dblp:journals/tosc/WangSL17 fatcat:3dbxq243yjb4bm42sfubl2b5re

Cryptanalysis of 48-step RIPEMD-160

Gaoli Wang, Yanzhao Shen, Fukang Liu
2017 IACR Transactions on Symmetric Cryptology  
Moreover, we propose a semi-free-start collision attack on 48-step RIPEMD-160, which improves the best semi-free start collision by 6 rounds.  ...  Then a semi-free-start collision attack on 48-step RIPEMD-160 can be obtained based on the differential path constructed by Mendel et al. at ASIACRYPT 2013.  ...  This work is supported by the National Natural Science Foundation of China (Nos. 61572125,  ... 
doi:10.46586/tosc.v2017.i2.177-202 fatcat:dben24gsafcd5b5cxetvlfvceq

The RIPEMDL and RIPEMDR Improved Variants of MD4 Are Not Collision Free [chapter]

Christophe Debaert, Henri Gilbert
2002 Lecture Notes in Computer Science  
In this paper, we present a method for finding collisions in each of the parallel lines of RIPEMD. The collision search procedure requires only a few seconds computing time.  ...  do not result in an increase of the collision search computation time.  ...  The best collision resistance one can hope to achieve with an m-bit function is bounded above by the O(2 m/2 ) complexity of a birthday attack.  ... 
doi:10.1007/3-540-45473-x_5 fatcat:2vf2cwrcc5dmbncxhwh5rxskqu

New (Two-Track-)MAC Based on the Two Trails of RIPEMD [chapter]

Bert den Boer, Bart Van Rompay, Bart Preneel, Joos Vandewalle
2001 Lecture Notes in Computer Science  
It is in comparison with the MDx-MAC based on RIPEMD-160, much more efficient on short messages (that is on messages of 512 or 1024 bits) and percentage-wise a little bit more efficient on long messages  ...  It is based on a two trail construction, which underlies the unkeyed hash function RIPEMD-160.  ...  and collision resistance).  ... 
doi:10.1007/3-540-45537-x_25 fatcat:x6bxveij4fcy5mh4whzxm4ctdu

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.  ...  In this paper we propose a hash function which follows design principle of SHA-1 and is based on dither construction.  ...  The RIPEMD-160 hash function [27] processes 512-bit input message blocks and produces a 160-bit hash value. Both RIPEMD-128 and RIPEMD -160 are extended to RIPEMD-256 and RIPEMD-320 respectively.  ... 
doi:10.2498/cit.1002181 fatcat:zwgk2nm5indcxblvgbql42tcnu

Improved Preimage Attacks on RIPEMD-160 and HAS-160

2018 KSII Transactions on Internet and Information Systems  
As far as we know, they are the best preimage and pseudo-preimage attacks on step-reduced RIPEMD-160 and HAS-160 respectively in terms of number of steps.  ...  A preimage attack on 35-step RIPEMD-160 and a preimage attack on 71-step HAS-160 are presented. Both of the attacks are from the intermediate step and satisfy the message padding.  ...  They should satisfy three classical security properties: collision resistance, preimage resistance and second preimage resistance.  ... 
doi:10.3837/tiis.2018.02.011 fatcat:rd3fb3zzlvg67ky6sepdvakqie

Collisions and Semi-Free-Start Collisions for Round-Reduced RIPEMD-160 [chapter]

Fukang Liu, Florian Mendel, Gaoli Wang
2017 Lecture Notes in Computer Science  
This is the first collision attack on round-reduced RIPEMD-160.  ...  Combining all these techniques, the time complexity of the semi-free-start collision attack on the first 36-step RIPEMD-160 can be reduced by a factor of 2 15.3 to 2 55.1 .  ...  In Section 5, we describe the collision attack on the first 30-step RIPEMD-160. In Section 6, we describe the improved semi-free-start collision attack on the first 36-step RIPEMD-160.  ... 
doi:10.1007/978-3-319-70694-8_6 fatcat:yns4wpbaarfcxbcx26of5zhioy

Evaluation On Recent Committed Crypt Analysis Hash Function

A. Arul Lawrence Selvakumar, C. Suresh Ganandhas
2008 Zenodo  
This paper describes the study of cryptographic hash functions, one of the most important classes of primitives used in recent techniques in cryptography.  ...  The performance of the new hash function is at least 30% better than that of SHA-256 in software. And it is secure against any known cryptographic attacks on hash functions.  ...  On the other hand, in case of RIPEMD-128/160, there is no attack result because RIPEMD-128/160 have different message-ordering in branches.  ... 
doi:10.5281/zenodo.1331192 fatcat:ofus3m3xkffihcltkrqkve3c6m
« Previous Showing results 1 — 15 out of 243 results