Quantum key-recovery attack on Feistel constructions: Bernstein–Vazirani meet Grover algorithm
Authors:
- 30 September 2021
- journal article
- research article
- Published by Springer Nature in Quantum Information Processing
- Vol. 20 (10) , 1-14
Abstract
No abstract availableKeywords
Funding Information
- 13th Five-Year National Cryptographic Fund (MMJJ20180217)
This publication has 21 references indexed in Scilit:
- New Attacks on Feistel Structures with Improved Memory Complexities2015
- Quantum amplitude amplification and estimation2002
- Quantum Computers Can Search Arbitrarily Large Databases by a Single QueryPhysical Review Letters, 1997
- Quantum Complexity TheorySIAM Journal on Computing, 1997
- On the Power of Quantum ComputationSIAM Journal on Computing, 1997
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- A construction of a cipher from a single pseudorandom permutationJournal of Cryptology, 1997
- Constructions of bent functions and difference sets1991
- How to Construct Pseudorandom Permutations from Pseudorandom FunctionsSIAM Journal on Computing, 1988
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978