Abstract
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.
Original language | English |
---|---|
Title of host publication | 2014 IEEE International Symposium on Information Theory (ISIT'14, Honolulu HI, USA, June 29-July 4, 2014) |
Place of Publication | Piscataway |
Publisher | Institute of Electrical and Electronics Engineers |
Pages | 1446-1450 |
ISBN (Print) | 978-1-4799-5186-4 |
DOIs | |
Publication status | Published - 2014 |
Event | conference; 2014 IEEE International Symposium on Information Theory; 2014-06-29; 2014-07-04 - Duration: 29 Jun 2014 → 4 Jul 2014 |
Conference
Conference | conference; 2014 IEEE International Symposium on Information Theory; 2014-06-29; 2014-07-04 |
---|---|
Period | 29/06/14 → 4/07/14 |
Other | 2014 IEEE International Symposium on Information Theory |