Open Access Open Access  Restricted Access Subscription or Fee Access

Discrete Logarithm and Cryptosystem

Sunil Kumar Kashyap, Birendra Kumar Sharma, Amitabh Banerjee


We formulate a new DLP and designed a PKC. Our ProposedDiscrete Logarithm Problem (PDLP) is distinct from the Traditional Discrete Logarithm Problem (TDLP), which is proved in this paper. We use this PDLP for design a PKC. Our claim that, this PKC is more secure than the previous PKC’s, because a one reason is enough in support of this statement that, the PDLP is more complex problem because the computation of this problem is more difficult, because this has the distinct mathematical structure as compare to the TDLP. Mathematics Subject Classification NO: 94A60.

Keywords: Proposed Discrete Logarithm Problem (PDLP), Public Key Cryptosystem (PKC), Traditional Discrete Logarithm Problem (TDLP), DLP, PKC.

Cite this Article: Sunil Kumar Kashyap, Birendra Kumar Sharma, Amitabh Banerjee. Discrete Logarithm and Cryptosystem. Journal of Open Source Developments. 2020; 7(2): 15–17p.

Full Text:



  • There are currently no refbacks.