Slidex attacks on the Even-Mansour encryption scheme
From MaRDI portal
Publication:2018815
DOI10.1007/s00145-013-9164-7zbMath1356.94056OpenAlexW1997331713WikidataQ123003692 ScholiaQ123003692MaRDI QIDQ2018815
Orr Dunkelman, Nathan Keller, Adi Shamir
Publication date: 25 March 2015
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-013-9164-7
provable securityslide attackEven-Mansour block ciphersingle-key Even-Mansourslidex attacktight security boundswhitening keys
Related Items
Related-key analysis of generalized Feistel networks with expanding round functions ⋮ Optimum attack on 3-round Feistel-2 structure ⋮ Separating invertible key derivations from non-invertible ones: sequential indifferentiability of 3-round Even-Mansour ⋮ Efficient slide attacks ⋮ Reflections on slide with a twist attacks ⋮ Quantum key recovery attacks on tweakable Even-Mansour ciphers ⋮ WEM: A New Family of White-Box Block Ciphers Based on the Even-Mansour Construction ⋮ New slide attacks on almost self-similar ciphers ⋮ Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A construction of a cipher from a single pseudorandom permutation.
- Advances in cryptology -- ASIACRYPT 2012. 18th international conference on the theory and application of cryptology and information security, Beijing, China, December 2--6, 2012. Proceedings
- Decorrelation: a theory for block cipher security
- Cycle detection using a stack
- Advances in cryptology -- EUROCRYPT 2012. 31st annual international conference on the theory and applications of cryptographic techniques, Cambridge, UK, April 15--19, 2012. Proceedings
- On the Indifferentiability of Key-Alternating Ciphers
- Key Recovery Attacks on 3-round Even-Mansour, 8-step LED-128, and Full AES2
- How to Construct an Ideal Cipher from a Small Set of Public Permutations
- Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
- Minimalism in Cryptography: The Even-Mansour Scheme Revisited
- The LED Block Cipher
- Improved Slide Attacks
- Limitations of the Even-Mansour construction
- Improved Attacks on Full GOST
- Differential Analysis of the LED Block Cipher
- An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher
- Power of a Public Random Permutation and Its Application to Authenticated Encryption
- Tight Security Bounds for Key-Alternating Ciphers
- Nondeterministic Algorithms
- How to protect DES against exhaustive key search (an analysis of DESX).
