Mostrar el registro sencillo del ítem

Quantum Information Set Decoding Algorithms

hal.structure.identifierSecurity, Cryptology and Transmissions [SECRET]
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
dc.contributor.authorKACHIGAR, Ghazal
hal.structure.identifierSecurity, Cryptology and Transmissions [SECRET]
dc.contributor.authorTILLICH, Jean-Pierre
dc.contributor.editorTanja Lange
dc.contributor.editorTsuyoshi Takagi
dc.date.accessioned2024-04-04T03:07:42Z
dc.date.available2024-04-04T03:07:42Z
dc.date.conference2017-06-26
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/193466
dc.description.abstractEnThe security of code-based cryptosystems such as the Mc\-Eliece cryptosystem relies primarily on the difficulty of decoding random linear codes. The best decoding algorithms are all improvements of an old algorithm due to Prange: they are known under the name of information set decoding techniques.It is also important to assess the security of such cryptosystems against a quantum computer. This research thread started in \cite{OS09} and thebest algorithm to date has been Bernstein's quantising \cite{B10} of the simplest information set decoding algorithm, namely Prange's algorithm.It consists in applying Grover's quantum search to obtain a quadratic speed-up of Prange's algorithm.In this paper, we quantise other information set decoding algorithms by using quantum walk techniques which were devised for the subset-sum problem in \cite{BJLM13}.This results in improving the worst-case complexity of $2^{0.06035n}$ of Bernstein's algorithm to$2^{0.05869n}$ with the best algorithm presented here (where $n$ is the codelength).
dc.language.isoen
dc.publisherSpringer
dc.subject.encode based cryptography
dc.subject.endecoding algorithms
dc.subject.enquantum algorithms
dc.title.enQuantum Information Set Decoding Algorithms
dc.typeCommunication dans un congrès
dc.identifier.doi10.1007/978-3-319-59879-6_5
dc.subject.halInformatique [cs]/Théorie de l'information [cs.IT]
dc.subject.halInformatique [cs]/Cryptographie et sécurité [cs.CR]
dc.description.sponsorshipEuropePost-quantum cryptography for long-term security
bordeaux.page69-89
bordeaux.volume10346
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.titlePQCrypto 2017 - The Eighth International Conference on Post-Quantum Cryptography
bordeaux.countryNL
bordeaux.conference.cityUtrecht
bordeaux.peerReviewedoui
hal.identifierhal-01661905
hal.version1
hal.invitednon
hal.proceedingsoui
hal.conference.end2017-06-28
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-01661905v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.volume=10346&rft.spage=69-89&rft.epage=69-89&rft.au=KACHIGAR,%20Ghazal&TILLICH,%20Jean-Pierre&rft.genre=unknown


Archivos en el ítem

ArchivosTamañoFormatoVer

No hay archivos asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem