Sieve-in-the-Middle: Improved MITM Attacks

DOI10.1007/978-3-642-40041-4_13zbMath1310.94135OpenAlexW183217503MaRDI QIDQ2845675

María Naya-Plasencia, Anne Canteaut, Bastien Vayssière

Publication date: 2 September 2013

Published in: Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40041-4_13

zbMATH Keywords

bicliquesmatching algorithmsmeet-in-the-middlesbox

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (20)

Meet-in-the-middle attacks revisited: key-recovery, collision, and preimage attacks ⋮ A survey on implementation of lightweight block ciphers for resource constraints devices ⋮ PRINCEv2. More security for (almost) no overhead ⋮ New Attacks on Feistel Structures with Improved Memory Complexities ⋮ Cryptanalysis of Full Sprout ⋮ Improving the Biclique Cryptanalysis of AES ⋮ Key guessing strategies for linear key-schedule algorithms in rectangle attacks ⋮ Bicliques with Minimal Data and Time Complexity for AES ⋮ Meet-in-the-Middle Attacks on Reduced-Round Hierocrypt-3 ⋮ A Higher Order Key Partitioning Attack with Application to LBlock ⋮ Meet-in-the-middle attack with splice-and-cut technique and a general automatic framework ⋮ Meet-in-the-middle preimage attacks on sponge-based hashing ⋮ Mind the \texttt{TWEAKEY} schedule: cryptanalysis on \texttt{SKINNYe-64-256} ⋮ Differential meet-in-the-middle cryptanalysis ⋮ Generic framework for key-guessing improvements ⋮ Impossible-Differential and Boomerang Cryptanalysis of Round-Reduced Kiasu-BC ⋮ ОБЗОР АТАК НА AES-128: К ПЯТНАДЦАТИЛЕТИЮ СТАНДАРТА AES ⋮ Efficient dissection of bicomposite problems with cryptanalytic applications ⋮ Reflection cryptanalysis of PRINCE-like ciphers ⋮ Improving key-recovery in linear attacks: application to 28-round PRESENT

This page was built for publication: Sieve-in-the-Middle: Improved MITM Attacks