PKC based on DLP
DOI:
https://doi.org/10.37591/rrdms.v7i2.2535Abstract
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.
Downloads
Published
Issue
Section
License
Declaration and Copyright Transfer Form
(to be completed by authors)
I/ We, the undersigned author(s) of the submitted manuscript, hereby declare, that the above manuscript which is submitted for publication in the STM Journals(s), is not published already in part or whole (except in the form of abstract) in any journal or magazine for private or public circulation, and, is not under consideration of publication elsewhere.
- I/We will not withdraw the manuscript after 1 week of submission as I have read the Author Guidelines and will adhere to the guidelines.
- I/We Author(s ) have niether given nor will give this manuscript elsewhere for publishing after submitting in STM Journal(s).
- I/ We have read the original version of the manuscript and am/ are responsible for the thought contents embodied in it. The work dealt in the manuscript is my/ our own, and my/ our individual contribution to this work is significant enough to qualify for authorship.
- I/We also agree to the authorship of the article in the following order:
Author’s name
1. ________________
2. ________________
3. ________________
4. ________________
| We Author(s) tick this box and would request you to consider it as our signature as we agree to the terms of this Copyright Notice, which will apply to this submission if and when it is published by this journal. |
