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.

Original language | English |
---|

Publisher | s.n. |
---|

Number of pages | 8 |
---|

Publication status | Published - 2014 |
---|

Name | arXiv.org |
---|

Volume | 1409.8220 [cs.IT] |
---|