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: | , , , , |
|---|---|
| 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!
|
| _version_ | 1832546752957251584 |
|---|---|
| author | J.‐F. Biasse X. Bonnetain E. Kirshanova A. Schrottenloher F. Song |
| author_facet | J.‐F. Biasse X. Bonnetain E. Kirshanova A. Schrottenloher F. Song |
| author_sort | J.‐F. Biasse |
| collection | DOAJ |
| description | 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 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. |
| format | Article |
| id | doaj-art-a1e47afc0caa42e0b0237a429fd2f4a4 |
| institution | Kabale University |
| issn | 1751-8709 1751-8717 |
| language | English |
| publishDate | 2023-03-01 |
| publisher | Wiley |
| record_format | Article |
| series | IET Information Security |
| spelling | doaj-art-a1e47afc0caa42e0b0237a429fd2f4a42025-02-03T06:47:17ZengWileyIET Information Security1751-87091751-87172023-03-0117217120910.1049/ise2.12081Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptographyJ.‐F. Biasse0X. Bonnetain1E. Kirshanova2A. Schrottenloher3F. Song4Center for Cryptographic Research University of South Florida Tampa Florida USACARAMBA Team, Inria Nancy ‐ Grand Est Villers‐lès‐Nancy FranceMathematical Methods in Information Security Lab I.Kant Baltic Federal University Kaliningrad Kaliningrad Oblast RussiaCryptology Group CWI Amsterdam The NetherlandsDepartment of Computer Science Portland State University Portland Oregon USAAbstract 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.https://doi.org/10.1049/ise2.12081 |
| spellingShingle | J.‐F. Biasse X. Bonnetain E. Kirshanova A. Schrottenloher F. Song Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography IET Information Security |
| title | Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography |
| title_full | Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography |
| title_fullStr | Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography |
| title_full_unstemmed | Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography |
| title_short | Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography |
| title_sort | quantum algorithms for attacking hardness assumptions in classical and post quantum cryptography |
| url | https://doi.org/10.1049/ise2.12081 |
| work_keys_str_mv | AT jfbiasse quantumalgorithmsforattackinghardnessassumptionsinclassicalandpostquantumcryptography AT xbonnetain quantumalgorithmsforattackinghardnessassumptionsinclassicalandpostquantumcryptography AT ekirshanova quantumalgorithmsforattackinghardnessassumptionsinclassicalandpostquantumcryptography AT aschrottenloher quantumalgorithmsforattackinghardnessassumptionsinclassicalandpostquantumcryptography AT fsong quantumalgorithmsforattackinghardnessassumptionsinclassicalandpostquantumcryptography |