Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography

Abstract 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 candidate...

Full description

Bibliographic Details
Published in:IET Information Security
Main Authors: J.‐F. Biasse, X. Bonnetain, E. Kirshanova, A. Schrottenloher, F. Song
Format: Article
Language:English
Published: Wiley 2023-03-01
Online Access:https://doi.org/10.1049/ise2.12081