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

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

Research output: Book/ReportReportAcademic

19 Citations (Scopus)
128 Downloads (Pure)

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
Publishers.n.
Number of pages11
Publication statusPublished - 2014

Publication series

NamearXiv.org
Volume1401.6025 [cs.IT]

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