Related-key analysis of generalized Feistel networks with expanding round functions
From MaRDI portal
Publication:826269
DOI10.1007/978-3-030-75539-3_14zbMath1479.94285OpenAlexW3158264705MaRDI QIDQ826269
Yuqing Zhao, Chun Guo, Wenqi Yu
Publication date: 20 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-75539-3_14
related-key attackblockcipheralternating Feistel networksCCA-securityexpanding Feistel networksH-coefficient technique
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the provable security of BEAR and LION schemes
- A practical-time related-key attack on the \texttt{KASUMI} cryptosystem used in GSM and 3G telephony
- Selected areas in cryptography. 15th international workshop, SAC 2008, Sackville, New Brunswick, Canada, August 14--15. Revised selected papers
- On the construction of pseudorandom permutations: Luby-Rackoff revisited
- New types of cryptanalytic attacks using related keys
- Provable security of (tweakable) block ciphers based on substitution-permutation networks
- Slidex attacks on the Even-Mansour encryption scheme
- New slide attacks on almost self-similar ciphers
- Provable related-key security of contracting Feistel networks
- On the Optimality of Non-Linear Computations of Length-Preserving Encryption Schemes
- Midori: A Block Cipher for Low Energy
- Related-Key Security for Pseudorandom Functions Beyond the Linear Barrier
- The Related-Key Analysis of Feistel Constructions
- On the Provable Security of the Iterated Even-Mansour Cipher Against Related-Key and Chosen-Key Attacks
- Feistel Ciphers
- Improved Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions
- The LED Block Cipher
- How to Encipher Messages on a Small Domain
- On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
- Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds
- On Generalized Feistel Networks
- Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks
- Format-Preserving Encryption
- 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
- Understanding the Related-Key Security of Feistel Ciphers From a Provable Perspective
- Advances in Cryptology – CRYPTO 2004
- Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions
- Tight Security Bounds for Key-Alternating Ciphers
- Fast Software Encryption
