Bicliques with Minimal Data and Time Complexity for AES

DOI10.1007/978-3-319-15943-0_10zbMath1356.94051MaRDI QIDQ2942833

Andrey Bogdanov, Mohona Ghosh, Somitra Kumar Sanadhya, Donghoon Chang

Publication date: 11 September 2015

Published in: Information Security and Cryptology - ICISC 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-15943-0_10

zbMATH Keywords

stars; block ciphers; meet-in-the-middle; biclique cryptanalysis; key recovery; AES-128; minimum data complexity

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

Revisiting related-key boomerang attacks on AES using computer-aided tool, Generalized MitM attacks on full TWINE, A Higher Order Key Partitioning Attack with Application to LBlock, Impossible-Differential and Boomerang Cryptanalysis of Round-Reduced Kiasu-BC, Improving the Biclique Cryptanalysis of AES

Cites Work

• Unnamed Item
• Unnamed Item
• Sieve-in-the-Middle: Improved MITM Attacks
• Narrow-Bicliques: Cryptanalysis of Full IDEA
• A Framework for Automated Independent-Biclique Cryptanalysis
• A Single-Key Attack on the Full GOST Block Cipher
• Advanced Meet-in-the-Middle Preimage Attacks: First Results on Full Tiger, and Improved Results on MD4 and SHA-2
• A 3-Subset Meet-in-the-Middle Attack: Cryptanalysis of the Lightweight Block Cipher KTANTAN
• Biclique Cryptanalysis of the Full AES
• Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1
• Finding Preimages in Full MD5 Faster Than Exhaustive Search
• Preimage Attacks on One-Block MD4, 63-Step MD5 and More
• Bicliques for Preimages: Attacks on Skein-512 and the SHA-2 Family
• Automatic Search of Attacks on Round-Reduced AES and Applications