Decoding One Out of Many

  • Nicolas Sendrier
Conference paper

DOI: 10.1007/978-3-642-25405-5_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7071)
Cite this paper as:
Sendrier N. (2011) Decoding One Out of Many. In: Yang BY. (eds) Post-Quantum Cryptography. PQCrypto 2011. Lecture Notes in Computer Science, vol 7071. Springer, Berlin, Heidelberg

Abstract

Generic decoding of linear codes is the best known attack against most code-based cryptosystems. Understanding and measuring the complexity of the best decoding techniques is thus necessary to select secure parameters. We consider here the possibility that an attacker has access to many cryptograms and is satisfied by decrypting (i.e. decoding) only one of them. We show that, for the parameter range corresponding to the McEliece encryption scheme, a variant of Stern’s collision decoding can be adapted to gain a factor almost \(\sqrt{N}\) when N instances are given. If the attacker has access to an unlimited number of instances, we show that the attack complexity is significantly lower, in fact the number of security bits is divided by a number slightly smaller than 3/2 (but larger than 1). Finally we give indications on how to counter those attacks.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Nicolas Sendrier
    • 1
  1. 1.INRIA Paris-Rocquencourt, Project-Team SECRETFrance

Personalised recommendations