A polynomial time attack against algebraic geometry code based public key cryptosystems
Alain Couvreur, Irene Márquez-Corbella, Ruud Pellikaan · 2014
We give a polynomial time attack on the McEliece public key cryptosystem based on algebraic geometry codes. Roughly speaking, this attacks runs in O(n4) operations in Fq, where n denotes the code length. Compared to previous attacks, the present one allows to recover a decoding algorithm for the public key even for codes from high genus curves.