How to Achieve a McEliece-Based Digital Signature Scheme - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2001

How to Achieve a McEliece-Based Digital Signature Scheme


McEliece is one of the oldest known public key cryptosystems. Though it was less widely studied that RSA, it is remarkable that all known attacks are still exponential. It is widely believed that McEliece does not allow practical digital signatures. In the present paper we disprove this belief and show several ways to build a practical signature scheme based on McEliece. The security is provably reduced in the random oracle model to the well-known \em syndrome decoding problem and the distinguishability of permuted binary Goppa codes from a random code. For example we are able to propose a scheme with signatures of 111-bits and a binary workfactor of $2^85$.
Fichier principal
Vignette du fichier
RR-4118.pdf (371.16 Ko) Télécharger le fichier

Dates and versions

inria-00072511 , version 1 (24-05-2006)


  • HAL Id : inria-00072511 , version 1


Nicolas Courtois, Matthieu Finiasz, Nicolas Sendrier. How to Achieve a McEliece-Based Digital Signature Scheme. [Research Report] RR-4118, INRIA. 2001. ⟨inria-00072511⟩
143 View
16224 Download


Gmail Facebook Twitter LinkedIn More