Quantum key-recovery attack on Feistel constructions: Bernstein-Vazirani meet Grover algorithm
From MaRDI portal
Publication:2685637
DOI10.1007/s11128-021-03256-0OpenAlexW3202377629WikidataQ114849353 ScholiaQ114849353MaRDI QIDQ2685637
Publication date: 22 February 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-021-03256-0
Related Items (3)
Quantum key recovery attacks on tweakable Even-Mansour ciphers ⋮ Quantum circuit implementation and resource analysis of LBlock and LiCi ⋮ Quantum cryptanalysis of Farfalle and (generalised) key-alternating Feistel networks
Cites Work
- Unnamed Item
- Unnamed Item
- A construction of a cipher from a single pseudorandom permutation.
- Grover meets Simon -- quantumly attacking the FX-construction
- Quantum Demiric-Selçuk meet-in-the-middle attacks: applications to 6-round generic Feistel constructions
- Characterization of linear structures
- Using Bernstein-Vazirani algorithm to attack block ciphers
- Breaking Symmetric Cryptosystems Using Quantum Period Finding
- Квантовые атаки на итерационные блочные шифры
- New Attacks on Feistel Structures with Improved Memory Complexities
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- A method for obtaining digital signatures and public-key cryptosystems
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Power of Quantum Computation
- Quantum Complexity Theory
- A quantum algorithm to approximate the linear structures of Boolean functions
This page was built for publication: Quantum key-recovery attack on Feistel constructions: Bernstein-Vazirani meet Grover algorithm