Digital Signature Scheme Based on McEliece
- Matthieu FiniaszAffiliated withENSTA
- , Nicolas SendrierAffiliated withProject-Team SECRET, INRIA Paris-Rocquencourt
In the CFS scheme , the digital signature is obtained by applying the decoding procedure of some public error correcting code on a digest of the message to be signed, obtained by a cryptographic hash function. Only the legal user, who knows the hidden algebraic structure of the code, can produce the signature, while anyone can check that the signature is a valid answer to the decoding problem.
The construction for the McEliece-based signature scheme was proposed by Courtois, Finiasz, and Sendrier in 2001 . Despite its name, this construction is based on Niederreiter’s encryption scheme rather than the original McEliece cryptosystem. It was the first practical code-based digital signature scheme with a security reduction to the Syndrome Decoding Problem.
The public key is a binary r ×n matrix H, which is an arbitrary parity ch ...
- Digital Signature Scheme Based on McEliece
- Reference Work Title
- Encyclopedia of Cryptography and Security
- pp 342-343
- Print ISBN
- Online ISBN
- Springer US
- Copyright Holder
- Springer Science+Business Media, LLC
- Additional Links
- Industry Sectors
- eBook Packages
- Editor Affiliations
- 376. Department of Mathematics and Computing Science, Eindhoven University of Technology
- 377. Center for Secure Information Systems, George Mason University
- Author Affiliations
- 1. ENSTA, ENSTA, France
- 2. Project-Team SECRET, INRIA Paris-Rocquencourt, B.P. 105, 78153, Le Chesnay, France
To view the rest of this content please follow the download PDF link above.