Automatic Search of Meet-in-the-Middle and Impossible Differential Attacks
From MaRDI portal
Publication:2829214
DOI10.1007/978-3-662-53008-5_6zbMath1372.94422OpenAlexW2496427131MaRDI QIDQ2829214
Pierre-Alain Fouque, Patrick Derbez
Publication date: 27 October 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53008-5_6
Related Items
Key guessing strategies for linear key-schedule algorithms in rectangle attacks ⋮ Meet-in-the-middle attack with splice-and-cut technique and a general automatic framework ⋮ Improved attacks against reduced-round Whirlwind ⋮ Exploiting non-full key additions: full-fledged automatic Demirci-Selçuk meet-in-the-middle cryptanalysis of SKINNY ⋮ Finding the impossible: automated search for full impossible-differential, zero-correlation, and integral attacks ⋮ Meet-in-the-middle preimage attacks on sponge-based hashing ⋮ Mind the \texttt{TWEAKEY} schedule: cryptanalysis on \texttt{SKINNYe-64-256} ⋮ Revisiting related-key boomerang attacks on AES using computer-aided tool ⋮ Automatic classical and quantum rebound attacks on AES-like hashing by exploiting related-key differentials ⋮ Automated key recovery attacks on round-reduced Orthros ⋮ Simplified MITM modeling for permutations: new (quantum) attacks ⋮ New algorithm for exhausting optimal permutations for generalized Feistel networks ⋮ Automatic search of meet-in-the-middle preimage attacks on AES-like hashing ⋮ New Impossible Differential Search Tool from Design and Cryptanalysis Aspects
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A SAT-based preimage analysis of reduced \textsc{Keccak} hash functions
- New attacks on IDEA with at least 6 rounds
- Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms — Design andAnalysis
- Structural Evaluation of AES and Chosen-Key Distinguisher of 9-Round AES-128
- Block Ciphers That Are Easier to Mask: How Far Can We Go?
- Automatic Search of Truncated Impossible Differentials for Word-Oriented Block Ciphers
- Scrutinizing and Improving Impossible Differential Attacks: Applications to CLEFIA, Camellia, LBlock and Simon
- Exhausting Demirci-Selçuk Meet-in-the-Middle Attacks Against Reduced-Round AES
- Cryptanalysis of FIDES
- The Simon and Speck Block Ciphers on AVR 8-Bit Microcontrollers
- Cryptanalysis of SP Networks with Partial Non-Linear Layers
- LBlock: A Lightweight Block Cipher
- Improved Meet-in-the-Middle Cryptanalysis of KTANTAN (Poster)
- Improved Single-Key Attacks on 8-Round AES-192 and AES-256
- Piccolo: An Ultra-Lightweight Blockcipher
- General Model of the Single-Key Meet-in-the-Middle Distinguisher on the Word-Oriented Block Cipher
- $\textnormal{\textsc{TWINE}}$: A Lightweight Block Cipher for Multiple Platforms
- The 128-Bit Blockcipher CLEFIA (Extended Abstract)
- Algebraic Cryptanalysis of 58-Round SHA-1
- A Meet-in-the-Middle Attack on 8-Round AES
- A Zero-Dimensional Gröbner Basis for AES-128
- Speeding up Collision Search for Byte-Oriented Hash Functions
- KATAN and KTANTAN — A Family of Small and Efficient Hardware-Oriented Block Ciphers
- Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
- PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications
- Analysis of Differential Attacks in ARX Constructions
- Improved Key Recovery Attacks on Reduced-Round AES in the Single-Key Setting
- Automatic Search of Attacks on Round-Reduced AES and Applications
- Information Security and Cryptology - ICISC 2003
- Applications of SAT Solvers to Cryptanalysis of Hash Functions
- Topics in Cryptology – CT-RSA 2006
