Bicliques with minimal data and time complexity for AES
From MaRDI portal
Publication:2942833
Recommendations
Cites work
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 3952651 (Why is no real title available?)
- A 3-Subset Meet-in-the-Middle Attack: Cryptanalysis of the Lightweight Block Cipher KTANTAN
- 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
- Automatic search of attacks on round-reduced AES and applications
- Biclique Cryptanalysis of the Full AES
- Bicliques for preimages: attacks on Skein-512 and the SHA-2 family
- Finding Preimages in Full MD5 Faster Than Exhaustive Search
- Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1
- Narrow-bicliques: cryptanalysis of full IDEA
- Preimage Attacks on One-Block MD4, 63-Step MD5 and More
- Sieve-in-the-middle: improved MITM attacks
Cited in
(11)- A higher order key partitioning attack with application to LBlock
- Biclique cryptanalysis of full round AES-128 based hashing modes
- Impossible-differential and boomerang cryptanalysis of round-reduced Kiasu-BC
- Fast software encryption attacks on AES
- Generalized MitM attacks on full TWINE
- Revisiting related-key boomerang attacks on AES using computer-aided tool
- Improving the biclique cryptanalysis of AES
- CryptAttackTester: high-assurance attack analysis
- A framework for automated independent-biclique cryptanalysis
- Biclique Cryptanalysis of the Full AES
- Biclique cryptanalysis on the full Crypton-256 and mCrypton-128
This page was built for publication: Bicliques with minimal data and time complexity for AES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942833)