Open Access Open Access  Restricted Access Subscription or Fee Access

PKC by NDLP

Sunil Kumar Kashyap, Abhishek Badholiya, Vijayant Verma

Abstract


In this paper, we formulate a new discrete logarithm problem (DLP) and designed a new public key cryptosystem (PKC). We also proved this DLP is distinct from the classical Gauss’s DLP (GDLP).
Mathematics Subject Classification NO.: 94A60.

Full Text:

PDF

References


W. Diffie, M.E. Hellman. New directions in cryptography, Trans Inform Theory. 1976; 22: 644–54p.

K. Bentahar. The equivalence between the DHP and DLP for elliptic curves used in practical applications, revisited, In: Proceedings of the 10th International Conference on Cryptography and Coding. 2005, 376–91p.

D.J. Bernstein, T. Lange. Safe curves: choosing safe curves for elliptic-curve cryptography. [Accessed August 17, 2014].

I. Blake, G. Seroussi, N.P. Smart. Advances in Elliptic Curve Cryptography. London Mathematical Society Lecture Note Series 317, 2005.

C. Diem. On the discrete logarithm problem in elliptic curves II, Algebra Number Theory. 2013, 1281–323p.

Discrete logarithm records. Wikipedia, retrieved August 18, 2014 from http://en.wikipedia.org/wiki/Discrete logarithm records.


Refbacks

  • There are currently no refbacks.