Abstract

Nowadays, all our information are kept in electronic form using the internet and trust that it cannot be accessed by anyone except the intended recipient. For the sake of this purpose, digital signature schemes play a significant role in providing authenticity and record management efficiency. A digital signature is an encoded record that moves with the electronically available document which needs to be signed and returns after the transaction has been completed. In code-based cryptography many digital signature scheme were given among them is CFS code-based digital signature scheme introduced in 2001. It is still considered to be the most popular electronically based signature scheme. The major drawback of this algorithm is its large publickey size. Due to this problem of CFS algorithm, new scheme is presented in this paper using the modified Quasi Cyclic LDPC code and LLR-BP decoding algorithm by replacing the Goppa code and the Patternson decoding scheme for the signing process. This scheme provides a fast and secure signature with public key size smaller than the previously existing schemes and it also strengthens the signature without being compromised with its security.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.