Feistel ciphers based on a single primitive
From MaRDI portal
Publication:6595935
DOI10.1007/978-3-031-47818-5_4zbMATH Open1546.94105MaRDI QIDQ6595935
Publication date: 30 August 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- Tweakable block ciphers
- Structural cryptanalysis of SASAS
- Improved domain extender for the ideal cipher
- Improved indifferentiability security proof for 3-round tweakable Luby-Rackoff
- Building blockcipher from small-block tweakable blockcipher
- Efficient slide attacks
- On the Optimality of Non-Linear Computations of Length-Preserving Encryption Schemes
- Indifferentiability of 8-Round Feistel Networks
- On the Indifferentiability of Key-Alternating Ciphers
- Generic Key Recovery Attack on Feistel Scheme
- Minimizing the Two-Round Even-Mansour Cipher
- On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction
- Cryptanalysis of Iterated Even-Mansour Schemes with Two Keys
- On the Provable Security of the Iterated Even-Mansour Cipher Against Related-Key and Chosen-Key Attacks
- The Characterization of Luby-Rackoff and Its Optimum Single-Key Variants
- Beyond-Birthday-Bound Security Based on Tweakable Block Cipher
- A Domain Extender for the Ideal Cipher
- The “Coefficients H” Technique
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- The block cipher Square
- Improved Attacks on Full GOST
- Tight Security Bounds for Key-Alternating Ciphers
- 10-Round Feistel is Indifferentiable from an Ideal Cipher
- Theory of Cryptography
- Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules)
This page was built for publication: Feistel ciphers based on a single primitive
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595935)
