Discrete Cryptography

Abstract

The theory of Public Key Cryptography (PKC) was introduced by Diffie and Hellman [2]. There was the key agreement protocol based on the Discrete Logarithm Problem (DLP) in 1976. In 1985, ElGamal [1] applied the concept of [1] and presented the first real and practical PKC. The security of this PKC interacts with the hardness of DLP. The discrete cryptography is presented in this paper. Cryptography interacts with the hard mathematical problem. This is the study based on Discrete Logarithm Problem. The structure of the DLP is analyzed over the finite field. In this paper, a PKC is proposed based on the variant of DLP.

2010 AMS Mathematics Subject Classification Number: 94A60.

Keywords: DLP, Finite Field, PKC, Cryptography, Protocol.

Cite this Article: Sunil Kumar Kashyap, Birendra Kumar Sharma, Amitabh Banerjee. Discrete Cryptography. Journal of Multimedia Technology & Recent Advancements. 2020; 7(2): 1–3p.