CCA security for contracting (quasi-)Feistel constructions with tight round complexity
From MaRDI portal
Publication:6587195
DOI10.1007/s10623-024-01394-xzbMATH Open1545.94065MaRDI QIDQ6587195
Publication date: 13 August 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- On Lai-Massey and quasi-Feistel ciphers
- Provable security of (tweakable) block ciphers based on substitution-permutation networks
- Provable related-key security of contracting Feistel networks
- Feistel Ciphers
- Extended Generalized Feistel Networks Using Matrix Representation to Propose a New Lightweight Block Cipher: <sc>Lilliput</sc>
- On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
- Beyond-Birthday-Bound Security Based on Tweakable Block Cipher
- A Domain Extender for the Ideal Cipher
- On Generalized Feistel Networks
- The “Coefficients H” Technique
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Two practical and provably secure block ciphers: BEAR and LION
- Unbalanced Feistel networks and block cipher design
- Faster Luby-Rackoff ciphers
- Tight Security Bounds for Key-Alternating Ciphers
- Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions
- BBB security for 5-round even-Mansour-based key-alternating Feistel ciphers
- New Wine Old Bottles: Feistel Structure Revised
This page was built for publication: CCA security for contracting (quasi-)Feistel constructions with tight round complexity