Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme

  • Léonard Dallot
Conference paper

DOI: 10.1007/978-3-540-88353-1_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4945)
Cite this paper as:
Dallot L. (2008) Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme. In: Lucks S., Sadeghi AR., Wolf C. (eds) Research in Cryptology. WEWoRC 2007. Lecture Notes in Computer Science, vol 4945. Springer, Berlin, Heidelberg

Abstract

Courtois, Finiasz and Sendrier proposed in 2001 a practical code-based signature scheme. We give a rigorous security analysis of a modified version of this scheme in the random oracle model. Our reduction involves two problems of coding theory widely considered as difficult, the Goppa Parametrized Bounded Decoding and the Goppa Code Distinguishing.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Léonard Dallot
    • 1
  1. 1.GREYC, UMR 6072, CaenFrance

Personalised recommendations