Filters








146 Hits in 4.2 sec

Improved Meet-in-the-Middle Preimage Attacks against AES Hashing Modes

Zhenzhen Bao, Lin Ding, Jian Guo, Haoyang Wang, Wenying Zhang
2020 IACR Transactions on Symmetric Cryptology  
Sasaki in 2011, introduced the first preimage attack against AES hashing modes with the AES block cipher reduced to 7 rounds, by the method of meet-in-the-middle.  ...  To the best of our knowledge, these are the first preimage attacks against 8-round AES hashing modes.  ...  Acknowledgments We thank Lei Wang for helpful discussions during the early phase of this work.  ... 
doi:10.46586/tosc.v2019.i4.318-347 fatcat:cjytpk6ikjg7rdj5wdy4tzobbm

Improved Meet-in-the-Middle Preimage Attacks against AES Hashing Modes

Zhenzhen Bao, Lin Ding, Jian Guo, Haoyang Wang, Wenying Zhang
2020 IACR Transactions on Symmetric Cryptology  
Sasaki in 2011, introduced the first preimage attack against AES hashing modes with the AES block cipher reduced to 7 rounds, by the method of meet-in-the-middle.  ...  To the best of our knowledge, these are the first preimage attacks against 8-round AES hashing modes.  ...  Acknowledgments We thank Lei Wang for helpful discussions during the early phase of this work.  ... 
doi:10.13154/tosc.v2019.i4.318-347 dblp:journals/tosc/BaoDGWZ19 fatcat:sw6m76lsufgt3ho5cwy4mdkhty

Meet-in-the-Middle Preimage Attacks on AES Hashing Modes and an Application to Whirlpool [chapter]

Yu Sasaki
2011 Lecture Notes in Computer Science  
We apply a recently developed meet-in-the-middle preimage approach.  ...  We study the security of AES in the open-key setting by showing an analysis on hash function modes instantiating AES including Davies-Meyer, Matyas-Meyer-Oseas, and Miyaguchi-Preneel modes.  ...  Acknowledgements I would like to thank the anonymous reviewers of FSE 2011 for many fruitful comments, especially for the research motivation and applications of the attack.  ... 
doi:10.1007/978-3-642-21702-9_22 fatcat:gzp3tijxhrap7hix5hlgsek4ba

Haraka v2 – Efficient Short-Input Hashing for Post-Quantum Applications

Stefan Kölbl, Martin M. Lauridsen, Florian Mendel, Christian Rechberger
2017 IACR Transactions on Symmetric Cryptology  
Such hash functions are the bottleneck in hash-based signature schemes like SPHINCS or XMSS, which is currently under standardization.  ...  We develop a general tool-based method to include arguments against attack vectors using truncated differentials.  ...  Acknowledgments The authors would like to thank Andreas Hülsing and Peter Schwabe for their discussions on the XMSS and SPHINCS hash-based signature schemes, in particular in relation to the applicability  ... 
doi:10.46586/tosc.v2016.i2.1-29 fatcat:f4jczsdndvhd5fnv7oamatbhve

Automatic Search of Meet-in-the-Middle Preimage Attacks on AES-like Hashing [article]

Zhenzhen Bao, Xiaoyang Dong, Jian Guo, Zheng Li, Danping Shi, Siwei Sun, Xiaoyun Wang
2020 IACR Cryptology ePrint Archive  
Acknowledgements We thank the anonymous reviewers for the helpful comments.  ...  It is a higher level of meet-in-the-middle procedure which calls our meet-in-the-middle pseudo-preimage attack as sub-procedures.  ...  Apart from the biclique attacks in [13] , the best previous pseudo-preimage attacks against AES-128 hashing modes remain as 7 rounds since 2011, with a time complexity of 2 120 by Sasaki [49] and improved  ... 
dblp:journals/iacr/BaoDGLSSW20 fatcat:5eqpqpc3vva5pbjl2gmcpip6lm

New Preimage Attacks against Reduced SHA-1 [chapter]

Simon Knellwolf, Dmitry Khovratovich
2012 Lecture Notes in Computer Science  
Keywords: SHA-1, preimage attack, differential meet-in-the-middle.  ...  The improved results come out of a differential view on the meet-in-the-middle technique originally developed by Aoki and Sasaki.  ...  We thank Christian Rechberger for interesting discussions on preimage attacks and SHA-1. This work was partially supported by the Hasler Foundation www.haslerfoundation.ch under project number 08065.  ... 
doi:10.1007/978-3-642-32009-5_22 fatcat:e3oqz5pckjdobdh2vkmrfb7tvu

Enhancing e-banking security: using whirlpool hash function for card number encryption

Doaa Yaseen Khudhur, Saif Saad Hameed, Shokhan M. Al-Barzinji
2018 International Journal of Engineering & Technology  
In addition, based on the review of several articles, I found that Whirlpool outperformed several hashing functions and resists several well-known attacks.  ...  In this paper, I propose the use of Whirlpool hash function to enhance the security of e-bank service providers by encrypting customer's card sensitive information.  ...  However, he also shows that the ten rounds Whirlpool hash function still secure in practice. 3) Meet-In-The-Middle Preimage Attack: Yu Sasaki proposed applying recently developed meet-in-the-middle Preimage  ... 
doi:10.14419/ijet.v7i2.13.12682 fatcat:hvfvgaa7m5adfi6cjkhejpflry

Preimage Analysis of the Maelstrom-0 Hash Function [chapter]

Riham AlTawy, Amr M. Youssef
2015 Lecture Notes in Computer Science  
More precisely, we apply a meet-in-the-middle preimage attack on the compression function and combine it with a guess and determine approach which allows us to obtain a 6-round pseudo preimage for a given  ...  Then, we propose a four stage attack in which we adopt another meetin-the-middle attack and a 2-block multicollision approach to defeat the two additional checksum chains and turn the pseudo preimage attack  ...  Acknowledgment The authors would like to thank the anonymous reviewers for their valuable comments and suggestions that helped improve the quality of the paper.  ... 
doi:10.1007/978-3-319-24126-5_7 fatcat:ik66ccianvblpmgsdxzbo5ttda

(Pseudo) Preimage Attack on Round-Reduced Grøstl Hash Function and Others [chapter]

Shuang Wu, Dengguo Feng, Wenling Wu, Jian Guo, Le Dong, Jian Zou
2012 Lecture Notes in Computer Science  
We also improve the time complexities of the preimage attacks against 5-round Whirlpool and 7-round AES hashes by Sasaki in FSE 2011.  ...  These results are obtained by a variant of meet-in-the-middle preimage attack framework by Aoki and Sasaki.  ...  The authors would also thank Lei Wang for useful discussions, Praveen Gauravaram for improving the editorial quality of this paper and reviewers of FSE 2012 for helpful comments.  ... 
doi:10.1007/978-3-642-34047-5_8 fatcat:tihtvdantrb7xgboqsdzaznsmq

Limited-Birthday Distinguishers for Hash Functions [chapter]

Mitsugu Iwamoto, Thomas Peyrin, Yu Sasaki
2013 Lecture Notes in Computer Science  
In this article, we investigate the use of limited-birthday distinguishers to the context of hash functions.  ...  A direct and surprising corollary is that these collision attacks are interesting for cryptanalysis even when their complexity goes beyond the 2 n/2 birthday bound and up to the 2 n preimage bound, and  ...  The authors would like to thank the anonymous referees for their helpful comments. Mitsugu Iwamoto is supported by JSPS KAKENHI Grant Number 23760330.  ... 
doi:10.1007/978-3-642-42045-0_26 fatcat:igi4hc64kfhlhcsfsu5abk4oiu

MITM Meets Guess-and-Determine: Further Improved Preimage Attacks against AES-like Hashing [article]

Zhenzhen Bao, Jian Guo, Danping Shi, Yi Tu
2021 IACR Cryptology ePrint Archive  
Since the Meet-in-the-Middle preimage attack against 7round AES hashing was found by Sasaki in 2011, the development of this research direction has never been stopped.  ...  In particular, the number of attacked rounds on Whirlpool and AES-256 hashing modes is extended from 6 to 7 and 9 to 10, respectively.  ...  Hashing and MITM Preimage AttacksIn this section, we give a brief introduction to AES-like hash function in a general way, and describe the Meet-in-the-Middle Preimage Attacks, before we can introduce  ... 
dblp:journals/iacr/BaoGST21 fatcat:54w237o4trhavd45qbww7a3mnq

Second Preimage Analysis of Whirlwind [chapter]

Riham AlTawy, Amr M. Youssef
2015 Lecture Notes in Computer Science  
Finally, by adopting another meet in the middle attack, we are able to generate n-block message second preimages of the 5 and 6-round reduced hash function with time complexity of 2 449 and 2 505 and memory  ...  More precisely, we apply a meet in the middle preimage attack on the compression function which allows us to obtain a 5-round pseudo preimage for a given compression function output with time complexity  ...  The authors would like to thank the anonymous reviewers for their valuable comments and suggestions that helped improve the quality of the paper.  ... 
doi:10.1007/978-3-319-16745-9_17 fatcat:usi7fzjqebg5bfx36di6xvwe5u

Investigating Fundamental Security Requirements on Whirlpool: Improved Preimage and Collision Attacks [chapter]

Yu Sasaki, Lei Wang, Shuang Wu, Wenling Wu
2012 Lecture Notes in Computer Science  
Later, Wu et al. improved its complexity and extended it to the preimage attack [26] . Note that Bogdanov et al. showed an attack on 10-round AES in hashing modes with the biclique technique [27] .  ...  Regarding the preimage attack, meet-in-the-middle (MitM) attack with the splice-and-cut technique proposed by Aoki and Sasaki [22] has been actively discussed.  ...  . , Related Work Meet-in-the-Middle (Second) Preimage Attack on Whirlpool In FSE 2011, Sasaki proposed the first MitM preimage attack on AES-like primitives [25] .  ... 
doi:10.1007/978-3-642-34961-4_34 fatcat:vts5u566mfds5f5q3rogmeaa5e

Meet-in-the-Middle Attacks Revisited: Focusing on Key-recovery and Collision Attacks [article]

Xiaoyang Dong, Jialiang Hua, Siwei Sun, Zheng Li, Xiaoyun Wang, Lei Hu
2021 IACR Cryptology ePrint Archive  
Moreover, improved (pseudo) preimage or collision attacks on round-reduced WHIRLPOOL, Grøstl, and hashing modes with AES-256 are obtained.  ...  In particular, employing the new representation of the AES key schedule due to Leurent and Pernot (EUROCRYPT 2021), we identify the first preimage attack on 10-round AES-256 hashing.  ...  We would like to thank the reviewers for their valuable comments and suggestions.  ... 
dblp:journals/iacr/DongHSLWH21 fatcat:kbtifwzmfvg6zn6qg2c44rinpy

Attacks on Hash Functions Based on Generalized Feistel: Application to Reduced-Round Lesamnta and SHAvite-3 512 [chapter]

Charles Bouillaguet, Orr Dunkelman, Gaëan Leurent, Pierre-Alain Fouque
2011 Lecture Notes in Computer Science  
This preimage attack on the compression function can be used for a second preimage attack on the hash function with complexity 2 n+(t−k)/2 using a standard unbalanced meet-in-the middle [8] .  ...  In this paper we study the strength of two hash functions which are based on Generalized Feistels. We describe a new kind of attack based on a cancellation property in the round function.  ...  Acknowledgements We would like to thank the members of the Graz ECRYPT meeting. Especially, we would like to express our gratitude to Emilia Käsper, Christian Rechberger, Søren S.  ... 
doi:10.1007/978-3-642-19574-7_2 fatcat:las3zzttxbg2pg6s7vwxfhwlya
« Previous Showing results 1 — 15 out of 146 results