Ítem
Solo Metadatos

A polynomial-time attack on the BBCRS scheme

Mostrar el registro sencillo de la publicación
dc.creatorCouvreur, Alainspa
dc.creatorOtmani, Ayoubspa
dc.creatorTillich, Jean-Pierrespa
dc.creatorGauthier-Umaña, Valériespa
dc.date.accessioned2020-05-25T23:56:49Z
dc.date.available2020-05-25T23:56:49Z
dc.date.created2015spa
dc.description.abstractThe BBCRS scheme is a variant of the McEliece public-key encryption scheme where the hiding phase is performed by taking the inverse of a matrix which is of the form T + R where T is a sparse matrix with average row/column weight equal to a very small quantity m, usually m and lt; 2, and R is a matrix of small rank z ? 1. The rationale of this new transformation is the reintroduction of families of codes, like generalized Reed-Solomon codes, that are famously known for representin insecure choices. We present a key-recovery attack when z = 1 and m is chosen between 1 and 1+R+O(1/?n) where R denotes the code rate. This attack has complexity O(n6) and breaks all the parameters suggested in the literature. © International Association for Cryptologic Research 2015.eng
dc.format.mimetypeapplication/pdf
dc.identifier.doihttps://doi.org/10.1007/978-3-662-46447-2_8
dc.identifier.urihttps://repository.urosario.edu.co/handle/10336/22532
dc.language.isoengspa
dc.publisherSpringer Verlagspa
dc.relation.citationEndPage193
dc.relation.citationStartPage175
dc.relation.citationTitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.relation.citationVolumeVol. 9020
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol.9020,(2015); pp. 175-193spa
dc.relation.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84925252708&doi=10.1007%2f978-3-662-46447-2_8&partnerID=40&md5=3e71bc41688d2344d74169ff7a4332a9spa
dc.rights.accesRightsinfo:eu-repo/semantics/openAccess
dc.rights.accesoAbierto (Texto Completo)spa
dc.source.instnameinstname:Universidad del Rosariospa
dc.source.reponamereponame:Repositorio Institucional EdocURspa
dc.subject.keywordCodes (symbols)spa
dc.subject.keywordCryptographyspa
dc.subject.keywordMatrix algebraspa
dc.subject.keywordPolynomial approximationspa
dc.subject.keywordReed-Solomon codesspa
dc.subject.keywordCode-based cryptographyspa
dc.subject.keywordComponent wisespa
dc.subject.keywordDistinguishersspa
dc.subject.keywordGeneralized reed-solomon codesspa
dc.subject.keywordKey recoveryspa
dc.subject.keywordPublic key cryptographyspa
dc.subject.keywordCode-based cryptographyspa
dc.subject.keywordComponent-wise product of codesspa
dc.subject.keywordDistinguisherspa
dc.subject.keywordGeneralized Reed-Solomon codesspa
dc.subject.keywordKey-recoveryspa
dc.titleA polynomial-time attack on the BBCRS schemespa
dc.typeconferenceObjecteng
dc.type.hasVersioninfo:eu-repo/semantics/publishedVersion
dc.type.spaDocumento de conferenciaspa
Archivos
Colecciones
Artículos