Asymmetric Key Cryptosystem and Digital Signature Algorithm Built on Discrete Logarithm Problem (DLP)

Abstract

The thoughts of data security prompt the advancement of Cryptography. At the end of the day, Cryptography is investigation of keeping data secure. In the advanced mark plot a message can be “marked” utilizing a secretly held decoding key. Anybody can confirm this mark utilizing the comparing freely uncovered encryption key. Marks can’t be fashioned, and an endorser can’t later prevent the legitimacy from claiming his mark. This has evident applications in “electronic mail” and “electronic assets exchange” frameworks. Cryptography, notwithstanding give secrecy, authenticity, integrity and non-revocation. The core of cryptography lies in the keys included and mystery of the keys used to encode or decode. Another vital issue is the key size that determines the strength of the key and complexity in executing brute force attack on the texts to recover the key. There have been different cryptographic algorithms suggested. And we give brief overview of mathematical back ground of public key cryptography. A novel the public key scheme and cryptographic signature system has been proposed and the security of system relies on difficulty of computing discrete logarithm problem over finite field.