How to Achieve a McEliece-Based Digital Signature Scheme

Abstract. McEliece is one of the oldest known public key cryptosystems. Though it was less widely studied than RSA, it is remarkable that all known attacks are still exponential. It is widely believed that code-based cryptosystems like McEliece do 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. Its security can be reduced in the random oracle model to the well-known 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 283 .

• Type: Conference
• Year: 2001
• Where: ASIACRYPT
• Authors: Nicolas Courtois, Matthieu Finiasz, Nicolas Sendrier
• Keywords: ASIACRYPT 2001, Cryptology, Permuted Binary Goppa, Practical Digital Signatures, Public Key Cryptosystems