A Public Key Cryptosystem Based on Discrete Logarithm Problem

Authors

  • Sunil Kumar Kashyap School of Advanced Sciences, Vellore Institute of Technology University, Vellore, Tamil Nadu
  • Abhishek Badholiya Kalinga University, Naya Raipur, Chhattisgarh
  • Vijayant Verma Kalinga University, Naya Raipur, Chhattisgarh

DOI:

https://doi.org/10.37628/jdcas.v3i2.658

Abstract

In this paper, we formulate another discrete logarithm problem (ADLP) and designed a new public key cryptosystem (PKC). We also proved, this ADLP involves some old DLPs (ODLP) but the complexity of our proposed DLP is different from the ODLP. Thus, the security is better as compare to the ODLP based PKCs. Mathematics Subject Classification NO.: 94A60.

Author Biographies

  • Sunil Kumar Kashyap, School of Advanced Sciences, Vellore Institute of Technology University, Vellore, Tamil Nadu
    Department of Mathematics
  • Abhishek Badholiya, Kalinga University, Naya Raipur, Chhattisgarh
    Department of Computer Science and Engineering
  • Vijayant Verma, Kalinga University, Naya Raipur, Chhattisgarh
    Department of Computer Science and Engineering

References

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

I. Blake, G. Seroussi, N. Smart. Elliptic Curves in Cryptography. London Mathematical Society Lecture Note Series 265, 1999.

M. Kolster. Introduction to Cryptography. 2009.

L.C. Washington. Elliptic Curves: Number Theory and Cryptography. 2nd Edn. Discrete Mathematics and Its Applications 50, 2008.

R. Barbulescu, P. Gaudy, A. Joux, E. Thom. A Heuristic QuasiPolynomial algorithm for discrete logarithm in finite fields of small characteristic, Adv Cryptol. EUROCRYPT 2014, 1–16p.

R. Balasubramanian, N. Koblitz. The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm, J Cryptol. 1998; 11(2): 141–5p.

Downloads

Published

2018-02-03

Issue

Vol. 3 No. 2 (2017)

Section

Articles