Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes
Information Theory
2014-09-30 v1 Cryptography and Security
Algebraic Geometry
math.IT
Abstract
We give a polynomial time attack on the McEliece public key cryptosystem based on subcodes of algebraic geometry (AG) codes. The proposed attack reposes on the distinguishability of such codes from random codes using the Schur product. Wieschebrink treated the genus zero case a few years ago but his approach cannot be extent straightforwardly to other genera. We address this problem by introducing and using a new notion, which we call the t-closure of a code.
Keywords
Cite
@article{arxiv.1409.8220,
title = {Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes},
author = {Alain Couvreur and Irene Márquez-Corbella and Ruud Pellikaan},
journal= {arXiv preprint arXiv:1409.8220},
year = {2014}
}