Automatic search of meet-in-the-middle and impossible differential attacks
From MaRDI portal
Publication:2829214
DOI10.1007/978-3-662-53008-5_6zbMATH Open1372.94422OpenAlexW2496427131MaRDI QIDQ2829214FDOQ2829214
Authors: Patrick Derbez, Pierre-Alain Fouque 
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
Recommendations
- Meet-in-the-middle attack with splice-and-cut technique and a general automatic framework
- New automatic search tool for searching for impossible differentials using undisturbed bits
- Automatic search of truncated impossible differentials for word-oriented block ciphers
- Exhausting Dmirci-Selçuk meet-in-the-middle attacks against reduced-round AES
- Automatic search of attacks on round-reduced AES and applications
Cites Work
- LBlock: a lightweight block cipher
- Piccolo: An Ultra-Lightweight Blockcipher
- $\textnormal{\textsc{TWINE}}$: A Lightweight Block Cipher for Multiple Platforms
- PRINCE -- a low-latency block cipher for pervasive computing applications. Extended abstract
- Title not available (Why is that?)
- Block ciphers that are easier to mask: how far can we go?
- Title not available (Why is that?)
- Title not available (Why is that?)
- The 128-Bit Blockcipher CLEFIA (Extended Abstract)
- Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
- Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms — Design andAnalysis
- Improved single-key attacks on 8-round AES-192 and AES-256
- A SAT-based preimage analysis of reduced \textsc{Keccak} hash functions
- Applications of SAT Solvers to Cryptanalysis of Hash Functions
- A Zero-Dimensional Gröbner Basis for AES-128
- KATAN and KTANTAN — A Family of Small and Efficient Hardware-Oriented Block Ciphers
- Improved meet-in-the-middle cryptanalysis of KTANTAN (poster)
- A Meet-in-the-Middle Attack on 8-Round AES
- Automatic search of attacks on round-reduced AES and applications
- Scrutinizing and improving impossible differential attacks: applications to CLEFIA, Camellia, Lblock and Simon
- The \textsc{Simon} and \textsc{Speck} block ciphers on AVR 8-bit microcontrollers
- Structural evaluation of AES and chosen-key distinguisher of 9-round AES-128
- Topics in Cryptology – CT-RSA 2006
- Speeding up Collision Search for Byte-Oriented Hash Functions
- Analysis of differential attacks in ARX constructions
- Algebraic Cryptanalysis of 58-Round SHA-1
- Information Security and Cryptology - ICISC 2003
- Automatic search of truncated impossible differentials for word-oriented block ciphers
- Title not available (Why is that?)
- General model of the single-key meet-in-the-middle distinguisher on the word-oriented block cipher
- Improved key recovery attacks on reduced-round AES in the single-key setting
- Exhausting Dmirci-Selçuk meet-in-the-middle attacks against reduced-round AES
- Cryptanalysis of FIDES
- Cryptanalysis of SP networks with partial non-linear layers
- New attacks on IDEA with at least 6 rounds
Cited In (30)
- Automatic search of attacks on round-reduced AES and applications
- Mind the \texttt{TWEAKEY} schedule: cryptanalysis on \texttt{SKINNYe-64-256}
- New impossible differential search tool from design and cryptanalysis aspects. Revealing structural properties of several ciphers
- Automated key recovery attacks on round-reduced Orthros
- New automatic search tool for searching for impossible differentials using undisturbed bits
- New algorithm for exhausting optimal permutations for generalized Feistel networks
- Sieve-in-the-middle: improved MITM attacks
- Automatic search algorithm for impossible differential trials and zero-correlation linear trials in SIMON
- Automated meet-in-the-middle attack goes to Feistel
- Meet-in-the-middle preimage attacks on sponge-based hashing
- Improved attacks against reduced-round Whirlwind
- Improved the automated evaluation algorithm against differential attacks and its application to WARP
- Automatic search of truncated impossible differentials for word-oriented block ciphers
- Simplified MITM modeling for permutations: new (quantum) attacks
- Meet-in-the-middle attack with splice-and-cut technique and a general automatic framework
- Automatic classical and quantum rebound attacks on AES-like hashing by exploiting related-key differentials
- Key guessing strategies for linear key-schedule algorithms in rectangle attacks
- Automatic search of meet-in-the-middle preimage attacks on AES-like hashing
- 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
- Improved meet-in-the-middle attacks on nine rounds of the AES-192 block cipher
- A generic algorithm for efficient key recovery in differential attacks -- and its associated tool
- Improved differential meet-in-the-middle cryptanalysis
- Revisiting related-key boomerang attacks on AES using computer-aided tool
- Integer linear programming for three-subset meet-in-the-middle attacks: application to GIFT
- Improved meet-in-the-middle attack on 10 rounds of the AES-256 block cipher
- Generic MitM attack frameworks on sponge constructions
- Mind the propagation of states. New automatic search tool for impossible differentials and impossible polytopic transitions
- Programming the Demirci-Selçuk meet-in-the-middle attack with constraints
- Automatic Demirci-Selçuk meet-in-the-middle attack on SKINNY with key-bridging
Uses Software
This page was built for publication: Automatic search of meet-in-the-middle and impossible differential attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829214)
