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) -
Classical and quantum algorithms for many-body problems
by: Ayral, Thomas
Published: (2025-01-01) -
Breaking barriers in two-party quantum cryptography via stochastic semidefinite programming
by: Akshay Bansal, et al.
Published: (2025-01-01) -
Classical and quantum spin liquids
by: Capponi, Sylvain
Published: (2025-01-01) -
Perspectives on Entangled Nuclear Particle Pairs Generation and Manipulation in Quantum Communication and Cryptography Systems
by: Octavian Dănilă, et al.
Published: (2012-01-01)