International Conference on the Theory and Application of Cryptology and Information Security

ASIACRYPT 2009: Advances in Cryptology – ASIACRYPT 2009 pp 88-105

Security Bounds for the Design of Code-Based Cryptosystems

  • Matthieu Finiasz
  • Nicolas Sendrier
Conference paper

DOI: 10.1007/978-3-642-10366-7_6

Volume 5912 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Finiasz M., Sendrier N. (2009) Security Bounds for the Design of Code-Based Cryptosystems. In: Matsui M. (eds) Advances in Cryptology – ASIACRYPT 2009. ASIACRYPT 2009. Lecture Notes in Computer Science, vol 5912. Springer, Berlin, Heidelberg

Abstract

Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has the convenient advantage of having only a few, well identified, attack algorithms. However, improvements to these algorithms have made their effective complexity quite complex to compute. We give here some lower bounds on the work factor of idealized versions of these algorithms, taking into account all possible tweaks which could improve their practical complexity. The aim of this article is to help designers select durably secure parameters.

Keywords

computational syndrome decodinginformation set decodinggeneralized birthday algorithm
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Matthieu Finiasz
    • 1
  • Nicolas Sendrier
    • 2
  1. 1.ENSTA 
  2. 2.INRIA, team-project SECRET