Skip to Main content Skip to Navigation
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.
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/hal-01069272
Contributor : Irene Márquez Corbella <>
Submitted on : Monday, September 29, 2014 - 10:25:50 AM
Last modification on : Thursday, March 5, 2020 - 6:29:51 PM
Document(s) archivé(s) le : Tuesday, December 30, 2014 - 10:26:08 AM

Files

29-ICMCTA4-Final.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01069272, version 1
  • ARXIV : 1409.8220

Collections

Citation

Alain Couvreur, Irene Márquez-Corbella, Ruud Pellikaan. Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes. 4th ICMCTA - Fourth International Castle Meeting on Coding Theory and Applications, Sep 2014, Palmela, Portugal. ⟨hal-01069272⟩

Share

Metrics

Record views

687

Files downloads

487