In EDS ansehen

Resource estimation of fault tolerant quantum information set decoding

Gespeichert in:
Bibliographische Detailangaben
Titel: Resource estimation of fault tolerant quantum information set decoding
Autoren: Hutchings, Kyle
Verlagsinformationen: Royal Holloway, University of London, 2022.
Publikationsjahr: 2022
Bestand: Royal Holloway, University of London
Schlagwörter: quantum computing, code based cryptography, Fault tolerance, resource estimation, Prange's algorithm, information set decoding
Beschreibung: With the ever-present threat of quantum computing looming over the world of cryptography, researchers have been investigating how best to replace existing cryptographic schemes with those that can withstand quantum attacks. Our research contributes to the area of resource estimation, a field concerned with analysing the amount of real-world resources (both temporal and spatial) required for a quantum computer to compromise a given cryptographic scheme using the best known current methods. We present a circuit to perform Prange's algorithm, a variant of quantum information set decoding. We embed our construction within an error-correction scheme in order to calculate the overhead costs incurred by fault-tolerance. Our analysis shows that current proposed parameters for code-based cryptography provide a much larger security margin than required for their specified security level, and as such could be reduced to improve performance whilst still ensuring quantum immunity.
Publikationsart: Electronic Thesis or Dissertation
Sprache: English
Zugangs-URL: https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.870021
Dokumentencode: edsble.870021
Datenbank: British Library EThOS
Beschreibung
Abstract:With the ever-present threat of quantum computing looming over the world of cryptography, researchers have been investigating how best to replace existing cryptographic schemes with those that can withstand quantum attacks. Our research contributes to the area of resource estimation, a field concerned with analysing the amount of real-world resources (both temporal and spatial) required for a quantum computer to compromise a given cryptographic scheme using the best known current methods. We present a circuit to perform Prange's algorithm, a variant of quantum information set decoding. We embed our construction within an error-correction scheme in order to calculate the overhead costs incurred by fault-tolerance. Our analysis shows that current proposed parameters for code-based cryptography provide a much larger security margin than required for their specified security level, and as such could be reduced to improve performance whilst still ensuring quantum immunity.