[Resource Topic] 2001/010: How to achieve a McEliece-based Digital Signature Scheme

Welcome to the resource topic for 2001/010

How to achieve a McEliece-based Digital Signature Scheme

Authors: Nicolas Courtois, Matthieu Finiasz, Nicolas Sendrier


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
code-based cryptosystems like McEliece does not allow practical
digital signatures. In the present paper we disprove this belief
and show a way to build a practical signature scheme based on coding
theory. It’s security can be 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 propose a scheme with signatures of 81-bits
and a binary security workfactor of 2^{83}.

ePrint: https://eprint.iacr.org/2001/010

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .