Skip to main navigation Skip to search Skip to main content

A polynomial time attack against algebraic geometry code based public key cryptosystems

  • Technical University of Eindhoven

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

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(n4) operations in Fq, where n denotes the code length. Compared to previous attacks, the present one allows to recover a decoding algorithm for the public key even for codes from high genus curves.

Original languageEnglish
Title of host publication2014 IEEE International Symposium on Information Theory, ISIT 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1446-1450
Number of pages5
ISBN (Print)9781479951864
DOIs
Publication statusPublished - 1 Jan 2014
Event2014 IEEE International Symposium on Information Theory, ISIT 2014 - Honolulu, HI, United States
Duration: 29 Jun 20144 Jul 2014

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference2014 IEEE International Symposium on Information Theory, ISIT 2014
Country/TerritoryUnited States
CityHonolulu, HI
Period29/06/144/07/14

Fingerprint

Dive into the research topics of 'A polynomial time attack against algebraic geometry code based public key cryptosystems'. Together they form a unique fingerprint.

Cite this