Smaller decoding exponents: Ball-collision decoding

Daniel J. Bernstein, Tanja Lange, Christiane Peters

Research output: Contribution to journalConference articleResearchpeer-review


Very few public-key cryptosystems are known that can encrypt and decrypt in time b2+o(1) with conjectured security level 2b against conventional computers and quantum computers. The oldest of these systems is the classic McEliece code-based cryptosystem. The best attacks known against this system are generic decoding attacks that treat McEliece's hidden binary Goppa codes as random linear codes. A standard conjecture is that the best possible w-error-decoding attacks against random linear codes of dimension k and length n take time 2(α(R,W)+o(1))n if k/n → R and w/n → W as n → ∞. Before this paper, the best upper bound known on the exponent α(R,W) was the exponent of an attack introduced by Stern in 1989. This paper introduces "ball-collision decoding" and shows that it has a smaller exponent for each (R,W): the speedup from Stern's algorithm to ball-collision decoding is exponential in n. © 2011 International Association for Cryptologic Research.
Keyword: Quantum computers,post-quantum cryptography,information-set decoding,Quantum cryptography,Decoding,Public key cryptography,McEliece cryptosystem,collision decoding,Quantum optics,Niederreiter cryptosystem,attacks,Post quantum cryptography
Original languageEnglish
Book seriesLecture Notes in Computer Science
Volume6841 LNCS
Pages (from-to)743-760
Publication statusPublished - 2011
Externally publishedYes
EventAnnual International Cryptology Conference -
Duration: 1 Jan 2011 → …
Conference number: 31


ConferenceAnnual International Cryptology Conference
Period01/01/2011 → …


Dive into the research topics of 'Smaller decoding exponents: Ball-collision decoding'. Together they form a unique fingerprint.

Cite this