Quantum attacks against type-1 generalized Feistel ciphers and applications to CAST-256
From MaRDI portal
Publication:2179408
DOI10.1007/978-3-030-35423-7_22zbMath1456.94101OpenAlexW2996213718MaRDI QIDQ2179408
Xiaoyang Dong, Gembu Ito, Boyu Ni, Tetsu Iwata
Publication date: 12 May 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-35423-7_22
Quantum computation (81P68) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items
On Quantum Distinguishers for Type-3 Generalized Feistel Network Based on Separability, Tight bounds for Simon's algorithm, Quantum cryptanalysis on contracting Feistel structures and observation on related-key settings, Quantum attacks on generalized Feistel networks based on the strong-weak separability, Post-quantum security on the Lai-Massey scheme, A quantum distinguisher for 7/8-round SMS4 block cipher, Applications of Simon's algorithm in quantum attacks on Feistel variants, Quantum attacks on sum of Even-Mansour pseudorandom functions, Quantum generic attacks on key-alternating Feistel ciphers for shorter keys, Some efficient quantum circuit implementations of Camellia
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On quantum slide attacks
- Grover meets Simon -- quantumly attacking the FX-construction
- Improved differential cryptanalysis on generalized Feistel schemes
- Quantum key-recovery on full AEZ
- Quantum Demiric-Selçuk meet-in-the-middle attacks: applications to 6-round generic Feistel constructions
- The security of Feistel ciphers with six rounds or less
- 4-round Luby-Rackoff construction is a qPRP
- Quantum attacks on some Feistel block ciphers
- Quantum chosen-ciphertext attacks against Feistel ciphers
- Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms — Design andAnalysis
- Breaking Symmetric Cryptosystems Using Quantum Period Finding
- Generic Key Recovery Attack on Feistel Scheme
- Meet-in-the-Middle Attacks on Generic Feistel Constructions
- Simpira v2: A Family of Efficient Permutations Using the AES Round Function
- Feistel Ciphers
- Improved Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions
- On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
- How to Protect DES Against Exhaustive Key Search
- New Attacks on Feistel Structures with Improved Memory Complexities
- The 128-Bit Blockcipher CLEFIA (Extended Abstract)
- On Generalized Feistel Networks
- New Linear Cryptanalytic Results of Reduced-Round of CAST-128 and CAST-256
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- On the Power of Quantum Computation
- Two practical and provably secure block ciphers: BEAR and LION
- Unbalanced Feistel networks and block cipher design
- Faster Luby-Rackoff ciphers
- Integral and Multidimensional Linear Distinguishers with Correlation Zero
- Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions
- Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions
- How to protect DES against exhaustive key search (an analysis of DESX).
