[Resource Topic] 2014/064: A Polynomial Time Attack against Algebraic Geometry Code Based Public Key Cryptosystems

Welcome to the resource topic for 2014/064

Title:
A Polynomial Time Attack against Algebraic Geometry Code Based Public Key Cryptosystems

Authors: Alain Couvreur, Irene Márquez-Corbella, Ruud Pellikaan

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.

ePrint: https://eprint.iacr.org/2014/064

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .