National Science Foundation, Grant/Award Numbers: 1846166, 2127742; Russian Science Foundation, Grant/Award Number: 21‐71‐00114
IET Information Security
Quantum Reduction -- applications, Quantum theory, Quantum computers -- Testing
In this survey, the authors review the main quantum algorithms for solving the computational problems that serve as hardness assumptions for cryptosystem. To this end, the authors consider both the currently most widely used classically secure cryptosystems, and the most promising candidates for post-quantum secure cryptosystems. The authors provide details on the cost of the quantum algorithms presented in this survey. The authors furthermore discuss ongoing research directions that can impact quantum cryptanalysis in the future.
Copyright (c) 2022 The Authors
This work is licensed under a Creative Commons Attribution 4.0 International License.
Locate the Document
Biasse, J. F., Bonnetain, X., Kirshanova, E., Schrottenloher, A., & Song, F. (2022). Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography. IET Information Security.