Abstract
We propose a new representation of Discrete Logarithm Problem (DLP) as and use this to design a Public Key Cryptosystem (PKC). The problem to find the index of the primitive element of the cyclic group is referred as the DLP. This paper sets the discrete structure of the finite field for introducing the securer PKC than the existed. Key Words: DLP, PKC, Cyclic Group, Primitive Element, Finite Field. Cite this Article: Sunil Kumar Kashyap, Birendra Kumar Sharma, Amitabh Banerjee. PKC based on DLP: Research & Reviews: Discrete Mathematical Structures. 2020; 7(2): 28–30p.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
