Extended meet-in-the-middle attacks on some Feistel constructions
From MaRDI portal
Publication:2630716
DOI10.1007/s10623-015-0120-4zbMath1348.94053OpenAlexW1408712796MaRDI QIDQ2630716
Yu Sasaki, Jérémy Jean, Jian Guo, Ivica Nikolić
Publication date: 21 July 2016
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-015-0120-4
Related Items (2)
Quantum meet-in-the-middle attack on Feistel construction ⋮ Automatic search of meet-in-the-middle preimage attacks on AES-like hashing
Uses Software
Cites Work
- Towards the optimality of Feistel ciphers with substitution-permutation functions
- The security of Feistel ciphers with six rounds or less
- Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms — Design andAnalysis
- Generic Key Recovery Attack on Feistel Scheme
- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
- The Simon and Speck Block Ciphers on AVR 8-Bit Microcontrollers
- LBlock: A Lightweight Block Cipher
- Advanced Meet-in-the-Middle Preimage Attacks: First Results on Full Tiger, and Improved Results on MD4 and SHA-2
- Improved Single-Key Attacks on 8-Round AES-192 and AES-256
- Piccolo: An Ultra-Lightweight Blockcipher
- All Subkeys Recovery Attack on Block Ciphers: Extending Meet-in-the-Middle Approach
- A Meet-in-the-Middle Attack on 8-Round AES
- Finding Preimages in Full MD5 Faster Than Exhaustive Search
- Preimages for Step-Reduced SHA-2
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- The Data Encryption Standard (DES) and its strength against attacks
- The block cipher Square
- Improved Key Recovery Attacks on Reduced-Round AES in the Single-Key Setting
- Upper Bounds for the Security of Several Feistel Networks
This page was built for publication: Extended meet-in-the-middle attacks on some Feistel constructions
