Skip to Main content Skip to Navigation

A Polynomial Time Attack against Algebraic Geometry Code Based Public Key Cryptosystems

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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00937476
Contributor : Irene Márquez Corbella <>
Submitted on : Tuesday, January 28, 2014 - 2:19:22 PM
Last modification on : Thursday, March 5, 2020 - 6:23:56 PM

Links full text

Identifiers

Collections

Citation

Alain Couvreur, Irene Márquez-Corbella, Ruud Pellikaan. A Polynomial Time Attack against Algebraic Geometry Code Based Public Key Cryptosystems. Information Theory (ISIT), 2014 IEEE International Symposium on, Jun 2014, Honolulu, United States. pp.1446-1450, ⟨10.1109/ISIT.2014.6875072⟩. ⟨hal-00937476⟩

Share

Metrics

Record views

555