On the resilience of Even-Mansour to invariant permutations
From MaRDI portal
Publication:831175
DOI10.1007/S10623-021-00850-2zbMATH Open1462.94045OpenAlexW3130355687MaRDI QIDQ831175FDOQ831175
Authors: Bart Mennink, Samuel Neves 
Publication date: 10 May 2021
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-021-00850-2
Recommendations
Cites Work
- Tweaks and Keys for Block Ciphers: The TWEAKEY Framework
- Keccak
- CBEAM: efficient authenticated encryption from feebly one-way \(\varphi \) functions
- Saturated configurations of points in projective Galois spaces
- On defining sets for projective planes
- The geometry of covering codes: small complete caps and saturating sets in Galois spaces
- Title not available (Why is that?)
- Minimizing the two-round Even-Mansour cipher
- Key-alternating ciphers in a provable setting: encryption using a small number of public permutations. (Extended abstract)
- PRINTcipher: A Block Cipher for IC-Printing
- Full analysis of \textsc{PRINTcipher} with respect to invariant subspace attack: efficient key recovery and countermeasures
- Title not available (Why is that?)
- A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack
- Tight security bounds for key-alternating ciphers
- On the Indifferentiability of the Sponge Construction
- Title not available (Why is that?)
- Progress in Cryptology - INDOCRYPT 2004
- The Related-Key Security of Iterated Even–Mansour Ciphers
- The software performance of authenticated-encryption modes
- Title not available (Why is that?)
- Minimalism in cryptography: the Even-Mansour scheme revisited
- Constructions and families of covering codes and saturated sets of points in projective geometry
- Title not available (Why is that?)
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- The exact PRF security of truncation: tight bounds for keyed sponges and truncated CBC
- The “Coefficients H” Technique
- Title not available (Why is that?)
- A practical attack on KeeLoq
- The iterated random permutation problem with applications to cascade encryption
- Advances in cryptology -- CRYPTO 2011. 31st annual cryptology conference, Santa Barbara, CA, USA, August 14--18, 2011. Proceedings
- Improved differential attacks for ECHO and Grøstl
- The PHOTON family of lightweight hash functions
- Another look at complementation properties
- Fast software encryption. 22nd international workshop, FSE 2015, Istanbul, Turkey, March 8--11, 2015. Revised selected papers
- Almost universal forgery attacks on AES-based MAC's
- Advanced Encryption Standard – AES
- A generic approach to invariant subspace attacks: cryptanalysis of Robin, iSCREAM and Zorro
- Cryptanalysis of Ascon
- In How Many Ways Can You Write Rijndael?
- Linear codes with covering radius 2 and other new covering codes
- \texttt{Midori}: a block cipher for low energy
- Sum-free sets in vector spaces over \(GF(2)\)
- Proving resistance against invariant attacks: how to choose the round constants
- Full-state keyed duplex with built-in multi-user support
- Connecting tweakable and multi-key blockcipher security
- Efficient slide attacks
- Topics in cryptology -- CT-RSA 2014. The cryptographer's track at the RSA conference 2014, San Francisco, CA, USA, February 25--28, 2014. Proceedings
- Minimal 1-saturating sets and complete caps in binary projective spaces.
- Security of full-state keyed sponge and duplex: applications to authenticated encryption
- Practical Cryptanalysis of PAES
- Chaskey: an efficient MAC algorithm for 32-bit microcontrollers
- Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption
- XPX: generalized tweakable Even-Mansour with improved security guarantees
- BLAKE2: simpler, smaller, fast as MD5
- Security of Keyed Sponge Constructions Using a Modular Proof Approach
- Robust authenticated-encryption AEZ and the problem that it solves
- Nonlinear invariant attack. Practical attack on full SCREAM, iSCREAM, and Midori64
- Simpira v2: a family of efficient permutations using the AES round function
- Tweaking Even-Mansour ciphers
- Multi-key security: the Even-Mansour construction revisited
- On the Salsa20 Core Function
- Inside the Hypercube
- Short codes with a given covering radius
- Title not available (Why is that?)
- New bounds for keyed sponges with extendable output: independence between capacity and message length
- NORX: Parallel and scalable AEAD
- Analysis of BLAKE2
- Block cipher invariants as eigenvectors of correlation matrices
Cited In (4)
- Proving resistance against invariant attacks: how to choose the round constants
- On invariant subspaces in the Lai-Massey scheme and a primitivity reduction
- Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\)
- Quantum key recovery attacks on tweakable Even-Mansour ciphers
Uses Software
This page was built for publication: On the resilience of Even-Mansour to invariant permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831175)
