A Non Asymptotic Analysis of Information Set Decoding

Yann Hamdaoui; Nicolas Sendrier

Paper 2013/162 Original: eprint.iacr.org/2013/162 ↗

A Non Asymptotic Analysis of Information Set Decoding

Yann Hamdaoui

Nicolas Sendrier

Abstract

We propose here a non asymptotic complexity analysis of some variants of information set decoding. In particular, we give this analysis for the two recent variants { published by May, Meurer and Thomae in 2011 and by Becker, Joux, May and Meurer in 2012 { for which only an asymptotic analysis was available. The purpose is to provide a simple and accurate estimate of the complexity to facilitate the paramater selection for code-based cryptosystems. We implemented those estimates and give a comparison at the end of the paper.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
History: 2013-03-26: last updated; 2013-03-26: published
Short URL: https://ia.cr/2013/162
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2013/162,
      author = {Yann Hamdaoui and Nicolas Sendrier},
      title = {A Non Asymptotic Analysis of Information Set Decoding},
      howpublished = {Cryptology {ePrint} Archive, Paper 2013/162},
      year = {2013},
      url = {https://eprint.iacr.org/2013/162}
}