Paper 2014/064

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

Alain Couvreur, Irene Márquez-Corbella, and 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.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint. Minor revision.
Keywords
Algebraic Geometry codes
Contact author(s)
irene marquez-corbella @ inria fr
History
2014-01-28: received
Short URL
https://ia.cr/2014/064
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2014/064,
      author = {Alain Couvreur and Irene Márquez-Corbella and Ruud Pellikaan},
      title = {A Polynomial Time Attack against Algebraic Geometry Code Based Public Key Cryptosystems},
      howpublished = {Cryptology ePrint Archive, Paper 2014/064},
      year = {2014},
      note = {\url{https://eprint.iacr.org/2014/064}},
      url = {https://eprint.iacr.org/2014/064}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.