Minimalism in Cryptography: The Even-Mansour Scheme Revisited
From MaRDI portal
Publication:2894417
DOI10.1007/978-3-642-29011-4_21zbMath1297.94065OpenAlexW1810232834MaRDI QIDQ2894417
Orr Dunkelman, Nathan Keller, Adi Shamir
Publication date: 29 June 2012
Published in: Advances in Cryptology – EUROCRYPT 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29011-4_21
minimalismprovable securityslide attacksslidex attacktight security boundswhitening keyseven-mansour block cipher
Related Items (41)
On the resilience of Even-Mansour to invariant permutations ⋮ Tweaking Even-Mansour Ciphers ⋮ The Iterated Random Permutation Problem with Applications to Cascade Encryption ⋮ The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC ⋮ Key recovery attacks on iterated Even-Mansour encryption schemes ⋮ Beyond quadratic speedups in quantum attacks on symmetric schemes ⋮ Post-quantum security of the Even-Mansour cipher ⋮ Connecting tweakable and multi-key blockcipher security ⋮ Security Analysis of PRINCE ⋮ Cryptanalysis of Round-Reduced $$\mathtt{LED}$$ ⋮ \(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations ⋮ Security analysis of Even-Mansour structure hash functions ⋮ Reflections on slide with a twist attacks ⋮ Keyed sum of permutations: a simpler RP-based PRF ⋮ Cryptanalytic time-memory-data trade-offs for FX-constructions and the affine equivalence problem ⋮ Meet-in-the-middle attacks and structural analysis of round-reduced PRINCE ⋮ From Farfalle to \textsc{Megafono} via Ciminion: the PRF \textsc{Hydra} for MPC applications ⋮ Simpira v2: A Family of Efficient Permutations Using the AES Round Function ⋮ How to Build Fully Secure Tweakable Blockciphers from Classical Blockciphers ⋮ A New Algorithm for the Unbalanced Meet-in-the-Middle Problem ⋮ Tight security for key-alternating ciphers with correlated sub-keys ⋮ Provably secure reflection ciphers ⋮ Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules) ⋮ Provable security against generic attacks on stream ciphers ⋮ An efficient affine equivalence algorithm for multiple S-boxes and a structured affine layer ⋮ Output masking of tweakable Even-Mansour can be eliminated for message authentication code ⋮ Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head ⋮ Tight security analysis of 3-round key-alternating cipher with a single permutation ⋮ A compress slide attack on the full GOST block cipher ⋮ AKF: a key alternating Feistel scheme for lightweight cipher designs ⋮ Rotational cryptanalysis on MAC algorithm chaskey ⋮ Strengthening the Known-Key Security Notion for Block Ciphers ⋮ Key alternating ciphers based on involutions ⋮ On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks ⋮ Minimizing the two-round Even-Mansour cipher ⋮ Cryptography from the tropical Hessian pencil ⋮ Slidex attacks on the Even-Mansour encryption scheme ⋮ Reflection cryptanalysis of PRINCE-like ciphers ⋮ Key-Recovery Attacks Against the MAC Algorithm Chaskey ⋮ Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security ⋮ XPX: Generalized Tweakable Even-Mansour with Improved Security Guarantees
This page was built for publication: Minimalism in Cryptography: The Even-Mansour Scheme Revisited
