Samenvatting
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.
Originele taal-2 | Engels |
---|---|
Titel | Coding Theory and Applications |
Subtitel | 4th International Castle Meeting, Palmela Castle, Portugal, September 15-18, 2014 |
Redacteuren | R. Pinto, P.R. Malonek, P. Vetton |
Plaats van productie | Dordrecht |
Uitgeverij | Springer |
Pagina's | 133-140 |
Aantal pagina's | 8 |
ISBN van elektronische versie | 978-3-319-17296-5 |
ISBN van geprinte versie | 978-3-319-17295-8 |
DOI's | |
Status | Gepubliceerd - 2015 |
Evenement | 4th International Castle Meeting Coding Theory and Applications (4ICMCTA) - Palmela, Portugal Duur: 15 sep. 2014 → 18 sep. 2014 Congresnummer: 4 http://icmcta.web.ua.pt/ |
Publicatie series
Naam | CIM Series in Mathematical Sciences |
---|---|
Volume | 3 |
Congres
Congres | 4th International Castle Meeting Coding Theory and Applications (4ICMCTA) |
---|---|
Verkorte titel | ICMCTA |
Land/Regio | Portugal |
Stad | Palmela |
Periode | 15/09/14 → 18/09/14 |
Internet adres |