Ítem
Solo Metadatos

A distinguisher for high rate McEliece cryptosystems

Mostrar el registro sencillo de la publicación
dc.creatorFaugère, Jean-Charlesspa
dc.creatorGauthier-Umaña, Valériespa
dc.creatorOtmani, Ayoubspa
dc.creatorPerret, Ludovicspa
dc.creatorTillich, Jean-Pierrespa
dc.date.accessioned2020-08-28T15:50:04Z
dc.date.available2020-08-28T15:50:04Z
dc.date.created2011-12-01spa
dc.description.abstractThe Goppa Code Distinguishing (GCD) problem consists in distinguishing the matrix of a Goppa code from a random matrix. Up to now, it is widely believed that the GCD problem is a hard decisional problem. We present the first technique allowing to distinguish alternant and Goppa codes over any field. Our technique can solve the GCD problem in polynomial-time provided that the codes have rates sufficiently large. The key ingredient is an algebraic characterization of the key-recovery problem. The idea is to consider the dimension of the solution space of a linearized system deduced from a particular polynomial system describing a key-recovery. It turns out that experimentally this dimension depends on the type of code. Explicit formulas derived from extensive experimentations for the value of the dimension are provided for “generic” random, alternant, and Goppa code over any alphabet. Finally, we give explanations of these formulas in the case of random codes, alternant codes over any field and binary Goppa codes.eng
dc.format.mimetypeapplication/pdf
dc.identifier.doihttps://doi.org/10.1109/ITW.2011.6089437
dc.identifier.issnISBN: 978-1-4577-0438-3
dc.identifier.issnEISBN: 978-1-4577-0437-6
dc.identifier.urihttps://repository.urosario.edu.co/handle/10336/28909
dc.language.isoengspa
dc.publisherIEEEspa
dc.relation.citationEndPage286
dc.relation.citationStartPage282
dc.relation.citationTitle2011 IEEE Information Theory Workshop
dc.relation.ispartofIEEE Information Theory Workshop, ISBN: 978-1-4577-0438-3;EISBN: 978-1-4577-0437-6 (2011 ); pp. 282-286spa
dc.relation.urihttps://ieeexplore.ieee.org/document/6089437spa
dc.rights.accesRightsinfo:eu-repo/semantics/restrictedAccess
dc.rights.accesoRestringido (Acceso a grupos específicos)spa
dc.source2011 IEEE Information Theory Workshopspa
dc.source.instnameinstname:Universidad del Rosario
dc.source.reponamereponame:Repositorio Institucional EdocUR
dc.subject.keywordCryptographyspa
dc.subject.keywordVectorsspa
dc.subject.keywordEquationsspa
dc.subject.keywordDecodingspa
dc.subject.keywordGeneratorsspa
dc.titleA distinguisher for high rate McEliece cryptosystemsspa
dc.title.TranslatedTitleUn distintivo para los criptosistemas McEliece de alta velocidadspa
dc.typebookParteng
dc.type.hasVersioninfo:eu-repo/semantics/publishedVersion
dc.type.spaParte de librospa
Archivos
Colecciones
Libros