The week's pick
Reseach Article
Diffie-Hellman Key Agreement with Elliptic Curve Discrete Logarithm Problem
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 129 - Number 12 |
| Year of Publication: 2015 |
| Authors: Samta Gajbhiye, Sanjeev Karmakar, Monisha Sharma |
10.5120/ijca2015907030
|
Samta Gajbhiye, Sanjeev Karmakar, Monisha Sharma . Diffie-Hellman Key Agreement with Elliptic Curve Discrete Logarithm Problem. International Journal of Computer Applications. 129, 12 ( November 2015), 25-27. DOI=10.5120/ijca2015907030
Abstract
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. Government’s DSA), the elliptic curve discrete logarithm systems (also known as elliptic curve cryptosystems). This paper focuses on implementing cryptographic services with elliptic curve cryptography (ECC). The principle attraction of ECC is that it appears to offer equal security for a far smaller key size, thereby reducing processor overhead. This paper implements Diffie –Hellman Key aggrement Procotocol using Elliptic Curve as the mathematical technique over prime field Fp
References
- N. Koblitz. “Elliptic Curve Cryptosystems”. Mathematics of Computation, Vol. 48, pp 203-209, 1987
- V. Miller. “Uses of Elliptic Curves in cryptography”. CRYPT’85, LNCS 218, pp 417-426, 1986.
- P. Bulens, G. M. de Dormale and J. J. Quisqauter. “Hardware for collision search on Elliptic Curve over GF (2m)”. SHARCS, Ecrypt Workshop, 2006.
- Williams Stallings, Cryptography and Network Security, Prentice Hall, 4th Edition, 2006
- Diffie and M. E. Hellman. “New directions in cryptography”. IEEE Transactions on Infornation Theory, Vol. 22, No. 6, pp 644-654, 1976.
- Harper, G., Menezes, A., and Vanstone, S., “Public -key cryptosystems with very small key lengths,” Advance in Cryptology, EUROCRYPT ’92 - Lecture Notes in Computer Science, Volume 658, Springer-Verlag, pages 163-173, 1993.
- D. Hankerson, A. Menezes and S. Vanstone. Guide to Elliptic Curve Cryptography. Springer-Verlag, New York, NY, 2004. (book)
- M. S. Anoop. “Elliptic curve cryptography – an implementation tutorial”. Technical Report, Tata Elxsi Ltd, 2007.
- S. Kumar, et al. “Embedded end-to-end wireless security with ECDH key exchange”. In Proceedings of 46th IEEE International Midwest Symposium on Circuits and Systems, 2003
- Koblitz, N., A Course in Number Theory and Cryptography, Springer-Verlag, Second Edition,1994.(book)
Index Terms
Keywords