Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes

G.R. Pellikaan, I. Marquez-Corbella, A. Couvreur

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

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.
Original languageEnglish
Title of host publicationCoding Theory and Applications
Subtitle of host publication4th International Castle Meeting, Palmela Castle, Portugal, September 15-18, 2014
EditorsR. Pinto, P.R. Malonek, P. Vetton
Place of PublicationDordrecht
PublisherSpringer
Pages133-140
Number of pages8
ISBN (Electronic)978-3-319-17296-5
ISBN (Print)978-3-319-17295-8
DOIs
Publication statusPublished - 2015
Event4th International Castle Meeting Coding Theory and Applications (4ICMCTA) - Palmela, Portugal
Duration: 15 Sept 201418 Sept 2014
Conference number: 4
http://icmcta.web.ua.pt/

Publication series

NameCIM Series in Mathematical Sciences
Volume3

Conference

Conference4th International Castle Meeting Coding Theory and Applications (4ICMCTA)
Abbreviated titleICMCTA
Country/TerritoryPortugal
CityPalmela
Period15/09/1418/09/14
Internet address

Keywords

  • Algebraic geometry codes; Code-based cryptography; Schur products of codes; Distinguishers

Fingerprint

Dive into the research topics of 'Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes'. Together they form a unique fingerprint.

Cite this