A code-based digital signature scheme using modified quasi-cyclic low-density parity-check codes (QC-LDPC)

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Sahu, R., & Tripathi, B. P. (2019). A code-based digital signature scheme using modified quasi-cyclic low-density parity-check codes (QC-LDPC). International Journal of Engineering and Advanced Technology, 8(6), 2759–2763. https://doi.org/10.35940/ijeat.F8822.088619

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free