Reference Work Entry

Encyclopedia of Cryptography and Security

pp 344-347

Digital Signature Schemes from Codes

  • Philippe GaboritAffiliated withXLIM-DMI, University of Limoges
  • , Nicolas SendrierAffiliated withProject-Team SECRET, INRIA Paris-Rocquencourt

Related Concepts

Error Correcting Codes; Signature Scheme; Syndrome Decoding Problem; Zero-Knowledge Protocols


There exist three different types of methods to obtain a signature scheme with code-based systems (like for number theory–based schemes). The first method (similar to the RSA signature) consists in being able to decode a random element of the syndrome space. This point of view is developed by Courtois-Finiasz-Sendrier [1] and necessitates to hide very large codes to obtain a reasonable probability of decoding (cf. “Digital Signature Scheme Based on McEliece”). The second method uses zero-knowledge identification algorithms together with the Fiat-Shamir paradigm [2], which permits to transform such an algorithm into a signature algorithm. It generally leads to very long signature. For coding theory, the Stern identification protocol [3] is the most efficient. The last method (similar to the El Gamal signature scheme) consists in building a spec ...

This is an excerpt from the content