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

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

19 Citations (Scopus)

Abstract

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.
Original languageEnglish
Title of host publication2014 IEEE International Symposium on Information Theory (ISIT'14, Honolulu HI, USA, June 29-July 4, 2014)
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Pages1446-1450
ISBN (Print)978-1-4799-5186-4
DOIs
Publication statusPublished - 2014
Eventconference; 2014 IEEE International Symposium on Information Theory; 2014-06-29; 2014-07-04 -
Duration: 29 Jun 20144 Jul 2014

Conference

Conferenceconference; 2014 IEEE International Symposium on Information Theory; 2014-06-29; 2014-07-04
Period29/06/144/07/14
Other2014 IEEE International Symposium on Information Theory

Fingerprint Dive into the research topics of 'A polynomial time attack against algebraic geometry code based public key cryptosystems'. Together they form a unique fingerprint.

Cite this