Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules)
From MaRDI portal
Publication:6169461
DOI10.1007/978-3-031-22912-1_6zbMath1519.94197OpenAlexW4313347210MaRDI QIDQ6169461
Publication date: 14 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22912-1_6
Cites Work
- Unnamed Item
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- Separating invertible key derivations from non-invertible ones: sequential indifferentiability of 3-round Even-Mansour
- A construction of a cipher from a single pseudorandom permutation.
- Naor-Reingold goes public: the complexity of known-key security
- Indifferentiability of iterated Even-Mansour ciphers with non-idealized key-schedules: five rounds are necessary and sufficient
- Minimizing the two-round Even-Mansour cipher
- Minimizing the two-round tweakable Even-Mansour cipher
- Tight security analysis of 3-round key-alternating cipher with a single permutation
- A Synthetic Indifferentiability Analysis of Interleaved Double-Key Even-Mansour Ciphers
- Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
- Indifferentiability of 8-Round Feistel Networks
- On the Indifferentiability of Key-Alternating Ciphers
- How to Construct an Ideal Cipher from a Small Set of Public Permutations
- On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction
- Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
- Minimalism in Cryptography: The Even-Mansour Scheme Revisited
- To Hash or Not to Hash Again? (In)Differentiability Results for $$H^2$$ and HMAC
- Towards Understanding the Known-Key Security of Block Ciphers
- The Related-Key Security of Iterated Even–Mansour Ciphers
- On the Provable Security of the Iterated Even-Mansour Cipher Against Related-Key and Chosen-Key Attacks
- The random oracle methodology, revisited
- The LED Block Cipher
- Multi-key Security: The Even-Mansour Construction Revisited
- Strengthening the Known-Key Security Notion for Block Ciphers
- An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher
- Tight Security Bounds for Key-Alternating Ciphers
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Public-Seed Pseudorandom Permutations
- 10-Round Feistel is Indifferentiable from an Ideal Cipher
- Indifferentiability of Confusion-Diffusion Networks
- Theory of Cryptography
- Tight security for key-alternating ciphers with correlated sub-keys
This page was built for publication: Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules)