IACR News item: 28 January 2014
Alain Couvreur, Irene Márquez-Corbella, Ruud Pellikaan
ePrint Report
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.
Additional news items may be found on the IACR news page.