A Quantum Circuit to Speed-up the Cryptanalysis of Code-based Cryptosystem
Gespeichert in:
| Titel: | A Quantum Circuit to Speed-up the Cryptanalysis of Code-based Cryptosystem |
|---|---|
| Autoren: | S. Perriello, A. Barenghi, G. Pelosi |
| Weitere Verfasser: | J. Garcia-Alfaro, S. Li, R. Poovendran, H. Debar, M. Yung, Perriello, S., Barenghi, A., Pelosi, G. |
| Verlagsinformationen: | Springer International Publishing |
| Publikationsjahr: | 2021 |
| Bestand: | RE.PUBLIC@POLIMI - Research Publications at Politecnico di Milano |
| Schlagwörter: | Post-Quantum Cryptography, Code based cryptography, Information Set Decoding, Computer Security, Cryptography |
| Beschreibung: | The significant interest in cryptographic primitives providing sound security margins when facing attacks with quantum computers is witnessed by the ongoing USA National Institute of Standards and Technology Post-quantum Cryptography Standardization process. Sound and precise evaluation of the amount of computation required to break such cryptographic primitives by means of quantum computers is required to be able to choose the cryptosystem parameters. We present a full description of a quantum circuit to accelerate the computation of the solution of the Information Set Decoding problem , which is currently the best known non-structural attack against code-based cryptosystems. We validate our design running it on small instances of error correction codes, which allowed a complete validation on the AtoS QLM quantum computer simulator. We detail the circuit accelerating the exponential complexity search phase in the Lee and Brickell variant of the ISD solver, and provide its computational complexity for cryptographically relevant parameters taken from the third round candidates in the USA post-quantum standardization process. |
| Publikationsart: | conference object |
| Sprache: | English |
| Relation: | info:eu-repo/semantics/altIdentifier/isbn/978-303090021-2; info:eu-repo/semantics/altIdentifier/isbn/978-3-030-90022-9; info:eu-repo/semantics/altIdentifier/wos/WOS:000769464900025; ispartofbook:EAI SecureComm 2021 - 17th EAI International Conference on Security and Privacy in Communication Networks; EAI SecureComm 2021 - 17th EAI International Conference on Security and Privacy in Communication Networks; firstpage:458; lastpage:474; numberofpages:17; serie:LECTURE NOTES OF THE INSTITUTE FOR COMPUTER SCIENCES, SOCIAL INFORMATICS AND TELECOMMUNICATIONS ENGINEERING; alleditors:J. Garcia-Alfaro, S. Li, R. Poovendran, H. Debar, M. Yung; http://hdl.handle.net/11311/1191841 |
| DOI: | 10.1007/978-3-030-90022-9_25 |
| Verfügbarkeit: | http://hdl.handle.net/11311/1191841 https://doi.org/10.1007/978-3-030-90022-9_25 |
| Rights: | info:eu-repo/semantics/openAccess |
| Dokumentencode: | edsbas.FE423C8A |
| Datenbank: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | The significant interest in cryptographic primitives providing sound security margins when facing attacks with quantum computers is witnessed by the ongoing USA National Institute of Standards and Technology Post-quantum Cryptography Standardization process. Sound and precise evaluation of the amount of computation required to break such cryptographic primitives by means of quantum computers is required to be able to choose the cryptosystem parameters. We present a full description of a quantum circuit to accelerate the computation of the solution of the Information Set Decoding problem , which is currently the best known non-structural attack against code-based cryptosystems. We validate our design running it on small instances of error correction codes, which allowed a complete validation on the AtoS QLM quantum computer simulator. We detail the circuit accelerating the exponential complexity search phase in the Lee and Brickell variant of the ISD solver, and provide its computational complexity for cryptographically relevant parameters taken from the third round candidates in the USA post-quantum standardization process. |
|---|---|
| DOI: | 10.1007/978-3-030-90022-9_25 |