A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Diffie-Hellman Key Agreement with Elliptic Curve Discrete Logarithm Problem
2015
International Journal of Computer Applications
Since the invention of public -key cryptography, numerous public -key cryptographic systems have been proposed. Each of these systems relies on a difficult mathematical problem for its security. Today, three types of systems, classified according to the mathematical problem on which they are based, are generally considered both secure and efficient. The systems are:the integer factorization systems (of which RSA is the best known example), the discrete logarithm systems (such as the U.S.
doi:10.5120/ijca2015907030
fatcat:4hmuhvu4pvfn5g5pxp4x5pqk3i