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...
Saved in:
Main Authors: | J.‐F. Biasse, X. Bonnetain, E. Kirshanova, A. Schrottenloher, F. Song |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2023-03-01
|
Series: | IET Information Security |
Online Access: | https://doi.org/10.1049/ise2.12081 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Survey of Post-Quantum Cryptography Migration in Vehicles
by: Nils Lohmiller, et al.
Published: (2025-01-01) -
Research of the small Qubit quantum computing attack to the RSA public key cryptography
by: Bao-nan WANG, et al.
Published: (2017-10-01) -
A Toolchain for Assisting Migration of Software Executables Towards Post-Quantum Cryptography
by: Norrathep Rattanavipanon, et al.
Published: (2025-01-01) -
Progress and Security Analysis of Quantum Cryptography Communication
by: Junsen Lai, et al.
Published: (2015-06-01) -
FPGA multi-unit parallel optimization and implementation of post-quantum cryptography CRYSTALS-Kyber
by: Bin LI, et al.
Published: (2022-02-01)