A Higher Order Key Partitioning Attack with Application to LBlock
From MaRDI portal
Publication:2947084
DOI10.1007/978-3-319-18681-8_17zbMath1441.94067OpenAlexW2168236595MaRDI QIDQ2947084
Amr M. Youssef, Mohamed Tolba, Riham AlTawy
Publication date: 21 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-18681-8_17
Cites Work
- Sieve-in-the-Middle: Improved MITM Attacks
- Block Ciphers That Are Easier to Mask: How Far Can We Go?
- Impossible Differential Attacks on Reduced-Round LBlock
- Scrutinizing and Improving Impossible Differential Attacks: Applications to CLEFIA, Camellia, LBlock and Simon
- Bicliques with Minimal Data and Time Complexity for AES
- Differential Sieving for 2-Step Matching Meet-in-the-Middle Attack with Application to LBlock
- Low-Data Complexity Attacks on AES
- LBlock: A Lightweight Block Cipher
- A 3-Subset Meet-in-the-Middle Attack: Cryptanalysis of the Lightweight Block Cipher KTANTAN
- Biclique Cryptanalysis of the Full AES
- The LED Block Cipher
- Meet-in-the-Middle Technique for Integral Attacks against Feistel Ciphers
- PRESENT: An Ultra-Lightweight Block Cipher
- KATAN and KTANTAN — A Family of Small and Efficient Hardware-Oriented Block Ciphers
- Linear (Hull) and Algebraic Cryptanalysis of the Block Cipher PRESENT
- Impossible Differential Cryptanalysis of Reduced-Round LBlock
- Differential Analysis of the LED Block Cipher
- On Bruteforce-Like Cryptanalysis: New Meet-in-the-Middle Attacks in Symmetric Cryptanalysis
- Comprehensive Study of Integral Analysis on 22-Round LBlock
- Biclique Cryptanalysis of Full Round AES-128 Based Hashing Modes
This page was built for publication: A Higher Order Key Partitioning Attack with Application to LBlock
