Security Bounds for the Design of Code-based Cryptosystems

@inproceedings{Finiasz2009SecurityBF,
  title={Security Bounds for the Design of Code-based Cryptosystems},
  author={Matthieu Finiasz and Nicolas Sendrier},
  booktitle={IACR Cryptology ePrint Archive},
  year={2009}
}
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… CONTINUE READING
Highly Influential
This paper has highly influenced 19 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 171 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
101 Citations
26 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 101 extracted citations

171 Citations

0102030'09'11'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 171 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 26 references

SHA-3 proposal: FSB

  • D. Augot, M. Finiasz, Gaborit, Ph., S. Manuel, N. Sendrier
  • Submission to the SHA-3 NIST competition
  • 2008
Highly Influential
10 Excerpts

A public-key cryptosystem based on algebraic coding theory

  • R. J. McEliece
  • DSN Prog. Rep., Jet Prop. Lab., California Inst…
  • 1978
Highly Influential
8 Excerpts

A method for finding codewords of small weight

  • J. Stern
  • Wolfmann, J., Cohen, G. (eds.) Coding Theory 1988…
  • 1989
Highly Influential
4 Excerpts

Knapsack-type crytosystems and algebraic coding theory

  • H. Niederreiter
  • Prob. Contr. Inform. Theory 15(2), 157–166
  • 1986
Highly Influential
4 Excerpts

Explicit bounds for generic decoding algorithms for code-based cryptography

  • D. J. Bernstein, T. Lange, C. Peters, H. van Tilborg
  • Pre-proceedings of WCC 2009, pp. 168–180
  • 2009
1 Excerpt

Similar Papers

Loading similar papers…