A polynomial time attack against algebraic geometry code based public key cryptosystems

A. Couvreur, I. Márquez-Corbella, G.R. Pellikaan

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

26 Citaten (Scopus)

Samenvatting

We give a polynomial time attack on the McEliece public key cryptosystem based on algebraic geometry codes. Roughly speaking, this attacks runs in $O(n^4)$ operations in $\mathbb F_q$, where $n$ denotes the code length. Compared to previous attacks, allows to recover a decoding algorithm for the public key even for codes from high genus curves.
Originele taal-2Engels
Titel2014 IEEE International Symposium on Information Theory (ISIT'14, Honolulu HI, USA, June 29-July 4, 2014)
Plaats van productiePiscataway
UitgeverijInstitute of Electrical and Electronics Engineers
Pagina's1446-1450
ISBN van geprinte versie978-1-4799-5186-4
DOI's
StatusGepubliceerd - 2014
Evenement2014 IEEE International Symposium on Information Theory, ISIT 2014 - Honolulu, Verenigde Staten van Amerika
Duur: 30 jun. 20145 jul. 2014

Congres

Congres2014 IEEE International Symposium on Information Theory, ISIT 2014
Verkorte titelISIT
Land/RegioVerenigde Staten van Amerika
StadHonolulu
Periode30/06/145/07/14
Ander2014 IEEE International Symposium on Information Theory

Vingerafdruk

Duik in de onderzoeksthema's van 'A polynomial time attack against algebraic geometry code based public key cryptosystems'. Samen vormen ze een unieke vingerafdruk.

Citeer dit