Quantum cryptanalysis of Farfalle and (generalised) key-alternating Feistel networks
From MaRDI portal
Publication:6123047
DOI10.1007/s10623-023-01305-6arXiv2203.12018MaRDI QIDQ6123047
No author found.
Publication date: 4 March 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.12018
Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94) Boolean functions (94D10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Boolean functions and their applications in cryptography
- Tweakable block ciphers
- The complexity of evaluating interpolation polynomials
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Grover meets Simon -- quantumly attacking the FX-construction
- Breaking tweakable enciphering schemes using Simon's algorithm
- Quantum cryptanalysis on contracting Feistel structures and observation on related-key settings
- Quantum attacks without superposition queries: the offline Simon's algorithm
- Quantum attacks on some Feistel block ciphers
- Quantum chosen-ciphertext attacks against Feistel ciphers
- A quantum distinguisher for 7/8-round SMS4 block cipher
- Quantum key-recovery attack on Feistel constructions: Bernstein-Vazirani meet Grover algorithm
- Quantum forgery attacks on COPA, AES-COPA and marble authenticated encryption algorithms
- Breaking Symmetric Cryptosystems Using Quantum Period Finding
- PRESENT: An Ultra-Lightweight Block Cipher
- On the Inverse of the Sum of Matrices
- On the Power of Quantum Computation
- Higher Order Derivatives and Differential Cryptanalysis
- On Quantum Distinguishers for Type-3 Generalized Feistel Network Based on Separability
- Boolean Functions for Cryptography and Coding Theory
- Quantum linearization attacks
This page was built for publication: Quantum cryptanalysis of Farfalle and (generalised) key-alternating Feistel networks
