Samenvatting
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.
Originele taal-2 | Engels |
---|---|
Titel | 2014 IEEE International Symposium on Information Theory (ISIT'14, Honolulu HI, USA, June 29-July 4, 2014) |
Plaats van productie | Piscataway |
Uitgeverij | Institute of Electrical and Electronics Engineers |
Pagina's | 1446-1450 |
ISBN van geprinte versie | 978-1-4799-5186-4 |
DOI's | |
Status | Gepubliceerd - 2014 |
Evenement | 2014 IEEE International Symposium on Information Theory, ISIT 2014 - Honolulu, Verenigde Staten van Amerika Duur: 30 jun. 2014 → 5 jul. 2014 |
Congres
Congres | 2014 IEEE International Symposium on Information Theory, ISIT 2014 |
---|---|
Verkorte titel | ISIT |
Land/Regio | Verenigde Staten van Amerika |
Stad | Honolulu |
Periode | 30/06/14 → 5/07/14 |
Ander | 2014 IEEE International Symposium on Information Theory |