 |
 |
 |
Conference papers
Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes
Abstract : 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.
Cited literature [24 references]
https://hal.inria.fr/hal-01069272
Contributor : Irene Márquez Corbella Connect in order to contact the contributor
Submitted on : Monday, September 29, 2014 - 10:25:50 AM
Last modification on : Saturday, June 25, 2022 - 7:44:07 PM
Long-term archiving on: : Tuesday, December 30, 2014 - 10:26:08 AM
Contributor : Irene Márquez Corbella Connect in order to contact the contributor
Submitted on : Monday, September 29, 2014 - 10:25:50 AM
Last modification on : Saturday, June 25, 2022 - 7:44:07 PM
Long-term archiving on: : Tuesday, December 30, 2014 - 10:26:08 AM
Files
29-ICMCTA4-Final.pdf
Files produced by the author(s)
