Paper 2014/064 Original: eprint.iacr.org/2014/064 ↗
A Polynomial Time Attack against Algebraic Geometry Code Based Public Key Cryptosystems
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.
- History
- 2014-01-28: last updated
- 2014-01-28: published
- Short URL
- https://ia.cr/2014/064
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2014/064}
}