Open AccessQuantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography
Author(s) -
Biasse J.F.,
Bonnetain X.,
Kirshanova E.,
Schrottenloher A.,
Song F.
Publication year - 2023
Publication title -
iet information security
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 34
eISSN - 1751-8717
pISSN - 1751-8709
DOI - 10.1049/ise2.12081
Subject(s) - cryptosystem , quantum cryptography , quantum computer , computer science , cryptanalysis , post quantum cryptography , cryptography , quantum algorithm , theoretical computer science , quantum , algorithm , quantum information , quantum mechanics , physics
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.