Provable related-key security of contracting Feistel networks
From MaRDI portal
Publication:2057179
DOI10.1007/978-3-030-71852-7_31zbMath1479.94277OpenAlexW3138671111MaRDI QIDQ2057179
Chun Guo, Wenqi Yu, Yuqing Zhao
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-71852-7_31
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tweakable block ciphers
- A practical-time related-key attack on the \texttt{KASUMI} cryptosystem used in GSM and 3G telephony
- On the construction of pseudorandom permutations: Luby-Rackoff revisited
- New types of cryptanalytic attacks using related keys
- On the Optimality of Non-Linear Computations of Length-Preserving Encryption Schemes
- Related-Key Security for Pseudorandom Functions Beyond the Linear Barrier
- The Related-Key Analysis of Feistel Constructions
- Simpira v2: A Family of Efficient Permutations Using the AES Round Function
- Piccolo: An Ultra-Lightweight Blockcipher
- Distinguisher and Related-Key Attack on the Full AES-256
- How to Encipher Messages on a Small Domain
- On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
- On Generalized Feistel Networks
- Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks
- The “Coefficients H” Technique
- Related-Key Cryptanalysis of the Full AES-192 and AES-256
- 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
- Tight Security Bounds for Key-Alternating Ciphers
- Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions
- Fast Software Encryption
