A Polynomial Time Attack against Algebraic Geometry Code Based Public Key Cryptosystems - Archive ouverte HAL
Communication Dans Un Congrès Année : 2014

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

Résumé

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.

Dates et versions

hal-00937476 , version 1 (28-01-2014)

Identifiants

Citer

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⟩
323 Consultations
0 Téléchargements

Altmetric

Partager

More