A Public Key Cryptosystem Based on Discrete Logarithm Problem
Abstract
Mathematics Subject Classification NO.: 94A60.
Full Text:
PDFReferences
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.
DOI: https://doi.org/10.37628/jdcas.v3i2.658
Refbacks
- There are currently no refbacks.