Minimizing the two-round Even-Mansour cipher
DOI10.1007/S00145-018-9295-YzbMATH Open1442.94033OpenAlexW2803828316WikidataQ121803205 ScholiaQ121803205MaRDI QIDQ1994640FDOQ1994640
Authors: Shan Chen, Rodolphe Lampe, Jooyoung Lee, Yannick Seurin, John P. Steinberger 
Publication date: 1 November 2018
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-018-9295-y
Recommendations
indistinguishabilitykey-alternating cipherrandom permutation modelpseudorandom permutationgeneralized Even-Mansour ciphersum-capture problem
Cites Work
- A construction of a cipher from a single pseudorandom permutation.
- Title not available (Why is that?)
- On the indifferentiability of key-alternating ciphers
- 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. (Extended abstract)
- PRESENT: An Ultra-Lightweight Block Cipher
- Tight security bounds for key-alternating ciphers
- How to protect DES against exhaustive key search (an analysis of DESX).
- Title not available (Why is that?)
- Cryptanalysis of iterated Even-Mansour schemes with two keys
- Adavanced slide attacks
- Limitations of the Even-Mansour construction
- An asymptotically tight security analysis of the iterated Even-Mansour cipher
- Block substitutions using orthomorphic mappings
- Title not available (Why is that?)
- Selected Areas in Cryptography
- Key Recovery Attacks on 3-round Even-Mansour, 8-step LED-128, and Full AES2
- Minimalism in cryptography: the Even-Mansour scheme revisited
- Cryptanalysis of Round-Reduced $$\mathtt{LED}$$
- The LED block cipher
- Title not available (Why is that?)
- The “Coefficients H” Technique
- Title not available (Why is that?)
- Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions
- Plain versus randomized cascading-based key-length extension for block ciphers
- Efficient and optimally secure key-length extension for block ciphers via randomized cascading
- Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption
- Testing Triangle-Freeness in General Graphs
Cited In (18)
- On the resilience of Even-Mansour to invariant permutations
- Breaking permutation-based pseudorandom cryptographic schemes using distributed exact quantum algorithms
- Security proofs for key-alternating ciphers with non-independent round permutations
- Key alternating ciphers based on involutions
- Multi-key security: the Even-Mansour construction revisited
- Keyed sum of permutations: a simpler RP-based PRF
- Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules)
- Key-alternating ciphers in a provable setting: encryption using a small number of public permutations. (Extended abstract)
- Tight security bounds for key-alternating ciphers
- Minimizing the two-round Even-Mansour cipher
- Tight security analysis of 3-round key-alternating cipher with a single permutation
- Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis
- An asymptotically tight security analysis of the iterated Even-Mansour cipher
- Beyond-birthday security for permutation-based Feistel networks
- New key recovery attacks on minimal two-round Even-Mansour ciphers
- Minimalism in cryptography: the Even-Mansour scheme revisited
- Minimizing the two-round tweakable Even-Mansour cipher
- On the sequential indifferentiability of the Lai-Massey construction
Uses Software
This page was built for publication: Minimizing the two-round Even-Mansour cipher
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1994640)
