Minimizing the two-round Even-Mansour cipher
From MaRDI portal
Publication:1994640
Recommendations
Cites work
- scientific article; zbMATH DE number 1594293 (Why is no real title available?)
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 177050 (Why is no real title available?)
- scientific article; zbMATH DE number 1504535 (Why is no real title available?)
- scientific article; zbMATH DE number 1418257 (Why is no real title available?)
- A construction of a cipher from a single pseudorandom permutation.
- Adavanced slide attacks
- An asymptotically tight security analysis of the iterated Even-Mansour cipher
- Block substitutions using orthomorphic mappings
- Cryptanalysis of Round-Reduced $$\mathtt{LED}$$
- Cryptanalysis of iterated Even-Mansour schemes with two keys
- Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions
- Efficient and optimally secure key-length extension for block ciphers via randomized cascading
- How to construct an ideal cipher from a small set of public permutations
- How to protect DES against exhaustive key search (an analysis of DESX).
- Key Recovery Attacks on 3-round Even-Mansour, 8-step LED-128, and Full AES2
- Key-alternating ciphers in a provable setting: encryption using a small number of public permutations. (Extended abstract)
- Limitations of the Even-Mansour construction
- Minimalism in cryptography: the Even-Mansour scheme revisited
- On the indifferentiability of key-alternating ciphers
- PRESENT: An Ultra-Lightweight Block Cipher
- Plain versus randomized cascading-based key-length extension for block ciphers
- Selected Areas in Cryptography
- Testing Triangle-Freeness in General Graphs
- The LED block cipher
- The “Coefficients H” Technique
- Tight security bounds for key-alternating ciphers
- Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption
Cited in
(18)- On the resilience of Even-Mansour to invariant permutations
- Breaking permutation-based pseudorandom cryptographic schemes using distributed exact quantum algorithms
- Key alternating ciphers based on involutions
- Security proofs for key-alternating ciphers with non-independent round permutations
- Multi-key security: the Even-Mansour construction revisited
- Keyed sum of permutations: a simpler RP-based PRF
- Key-alternating ciphers in a provable setting: encryption using a small number of public permutations. (Extended abstract)
- Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules)
- 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
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)
