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.
Original language | English |
---|---|
Title of host publication | Coding Theory and Applications |
Subtitle of host publication | 4th International Castle Meeting, Palmela Castle, Portugal, September 15-18, 2014 |
Editors | R. Pinto, P.R. Malonek, P. Vetton |
Place of Publication | Dordrecht |
Publisher | Springer |
Pages | 133-140 |
Number of pages | 8 |
ISBN (Electronic) | 978-3-319-17296-5 |
ISBN (Print) | 978-3-319-17295-8 |
DOIs | |
Publication status | Published - 2015 |
Event | 4th International Castle Meeting Coding Theory and Applications (4ICMCTA) - Palmela, Portugal Duration: 15 Sept 2014 → 18 Sept 2014 Conference number: 4 http://icmcta.web.ua.pt/ |
Publication series
Name | CIM Series in Mathematical Sciences |
---|---|
Volume | 3 |
Conference
Conference | 4th International Castle Meeting Coding Theory and Applications (4ICMCTA) |
---|---|
Abbreviated title | ICMCTA |
Country/Territory | Portugal |
City | Palmela |
Period | 15/09/14 → 18/09/14 |
Internet address |
Keywords
- Algebraic geometry codes; Code-based cryptography; Schur products of codes; Distinguishers