Filters








9 Hits in 0.73 sec

Practical Collisions for EnRUPT

Sebastiaan Indesteege, Bart Preneel
2010 Journal of Cryptology  
We demonstrate that our attack is practical by giving an actual collision example for EnRUPT-256.  ...  We present a practical collision attack on each of these seven EnRUPT variants.  ...  The collision example for EnRUPT-256 was obtained utilizing high performance computational resources provided by the University of Leuven, http://ludit.kuleuven.be/hpc.  ... 
doi:10.1007/s00145-010-9058-x fatcat:2a6fl2gb35hzhocbrpwqt4wiku

Practical Collisions for EnRUPT [chapter]

Sebastiaan Indesteege, Bart Preneel
2009 Lecture Notes in Computer Science  
We demonstrate that our attack is practical by giving an actual collision example for EnRUPT-256.  ...  We present a practical collision attack on each of these seven EnRUPT variants.  ...  The collision example for EnRUPT-256 was obtained utilizing high performance computational resources provided by the University of Leuven, http://ludit.kuleuven.be/hpc.  ... 
doi:10.1007/978-3-642-03317-9_15 fatcat:vi7iwq4pwranzgia2jp4i5zsqy

Improved Linear Differential Attacks on CubeHash [chapter]

Shahram Khazaei, Simon Knellwolf, Willi Meier, Deian Stefan
2010 Lecture Notes in Computer Science  
In combination with the condition function concept, such trails lead to much faster collision attacks. We demonstrate this by providing a real collision for CubeHash-5/96.  ...  The second method randomizes the search for highly probable linear differential trails and leads to significantly better attacks for up to eight rounds.  ...  The method of backward computation lead to the first practical collision attack on CubeHash-5/96.  ... 
doi:10.1007/978-3-642-12678-9_24 fatcat:4fyatp22wffr5osz5iri5sj5lm

Cryptanalysis of Round-Reduced HAS-160 [chapter]

Florian Mendel, Tomislav Nad, Martin Schläffer
2012 Lecture Notes in Computer Science  
In this paper, we present a semi-free-start collision for 65 (out of 80) steps of HAS-160 with practical complexity.  ...  To connect them, we are using an automatic search algorithm for the connecting characteristic utilizing the nonlinearity of the step function.  ...  In this paper, we combine different techniques to construct a semi-free start collision for 65 (out of 80) steps of HAS-160 with practical complexity.  ... 
doi:10.1007/978-3-642-31912-9_3 fatcat:quyhzc2ohjhwzj4kyjghi6imam

09031 Abstracts Collection – Symmetric Cryptography

Helena Handschuh, Stefan Lucks, Bart Preneel, Phillip Rogaway
2009
From 11.01.09 to 16.01.09, the Seminar 09031 in "Symmetric Cryptography " was held in Schloss Dagstuhl~--~Leibniz Center for Informatics.  ...  We demonstrate that our attack is practical by giving an actual collision example for EnRUPT-256.  ...  We present a practical collision attack on all of these seven EnRUPT variants.  ... 
doi:10.4230/dagsemproc.09031.1 fatcat:slxc7ufpqzaqpkq4bayytuqlru

Linearization Framework for Collision Attacks: Application to CubeHash and MD6 [chapter]

Eric Brier, Shahram Khazaei, Willi Meier, Thomas Peyrin
2009 Lecture Notes in Computer Science  
In this paper, an improved differential cryptanalysis framework for finding collisions in hash functions is provided.  ...  These concepts are applied to an in-depth collision analysis of reduced-round versions of the two SHA-3 candidates CubeHash and MD6, and are demonstrated to give by far the best currently known collision  ...  The recent attack on EnRUPT by Indesteege and Preneel [15] is another application of the method.  ... 
doi:10.1007/978-3-642-10366-7_33 fatcat:7df4bqpxzzhy3jf57c2flcne2y

Classification of the SHA-3 Candidates

Ewan Fleischmann, Christian Forler, Michael Gorski
2009 unpublished
First, we classify all publicly known candidates and, second, we outline and summarize the performance data as given in the candidates documentation for 64-bit and 32-bit implementations.  ...  For practical interest algorithms that are in speed class D or E will have a disadvantage for practical purpose, but they could possibly face a strong design.  ...  Collision Attack The best known collision attack that is better than the birthday attack.  ... 
fatcat:v7nv2tueevffffq7fxoudyzkqe

Finding Bugs in Cryptographic Hash Function Implementations

Nicky Mouha, Mohammad S. Raunak, D. Richard Kuhn, Raghu Kacker
2018 IEEE Transactions on Reliability  
Cryptographic hash functions are security-critical algorithms with many practical applications, notably in digital signatures.  ...  Developing an approach to test them can be particularly difficult, and bugs can remain unnoticed for many years.  ...  ACKNOWLEDGMENT The authors would like to thank Lily Chen, Ç agdaş Ç alık, Meltem Sönmez Turan, Apostol Vassilev, and their NIST colleagues for their useful comments and suggestions.  ... 
doi:10.1109/tr.2018.2847247 pmid:31092953 pmcid:PMC6512998 fatcat:nn3vxn5eqjg3dfu57wunfgo7fq

Heuristic Tool for Linear Cryptanalysis with Applications to CAESAR Candidates [chapter]

Christoph Dobraunig, Maria Eichlseder, Florian Mendel
2015 Lecture Notes in Computer Science  
This becomes particularly interesting when considering, for example, competitions like CAESAR. In such competitions, many cryptographic primitives are waiting for analysis.  ...  In recent years, various tools have been introduced to search for characteristics. The majority of these only deal with differential characteristics.  ...  Indesteege, S., Preneel, B.: Practical collisions for EnRUPT. In: Dunkelman, O. (ed.) Fast Software Encryption -FSE 2009. LNCS, vol. 5665, pp. 246-259. Springer (2009) 13.  ... 
doi:10.1007/978-3-662-48800-3_20 fatcat:4aw2s2bnq5fyxiinmxfim55aya