Open AccessA Novel Digital Signature based on Error Correcting Codes
Author(s) -
Younes Bayane,
Fatima Amounas,
Lahcen El Bermi
Publication year - 2019
Publication title -
international journal on recent and innovation trends in computing and communication
Language(s) - English
Resource type - Journals
ISSN - 2321-8169
DOI - 10.17762/ijritcc.v7i3.5253
Subject(s) - digital signature , computer science , communication source , signature (topology) , message authentication code , decoding methods , mceliece cryptosystem , blind signature , authentication (law) , error detection and correction , cryptography , theoretical computer science , code (set theory) , algorithm , public key cryptography , computer security , encryption , computer network , hash function , programming language , mathematics , geometry , set (abstract data type)
A digital signature is a cryptographic primitive for ensuring the authenticity of digital documents. A valid digital signature allows checking that a message was created by a known sender (authentication), that the sender cannot deny having sent the message (nonrepudiation), and that the message was not altered in transit (integrity).The idea of constructing practical signatures based on error correcting codes was introduced by Courtois et al in [1]. The main goal is to make digital signature for which the security is based on decoding syndrome problem. In this paper, a new construction of digital signature is considered which is an extension of the error correcting code construction. The proposed method consists of reordering the message bits to get a decodable word. Then apply an efficient decoding algorithm to get signature.