Kossi D. Edoh
ABSTRACT
The use of Java in developing commercial Internet applications is growing very rapidly. A major requirement for e-commerce applications is the provision of security. In this work we consider Elliptic Curve Cryptography (ECC) because of the high level of security it provides with small key sizes. ECC is ideal for use on constrained environments such as pagers, personal digital assistants, cellular phones and smart cards. We implement the ECC algorithms approved by the National Institute of Standards and Technology (NIST) in Java on the Dell Inspiron 7500. The speeds of the various ECC algorithms are provided.
- Agnew, G. B., Mullin, R. C., and Vanstone, S. A. An Implementation of elliptic curve cryptosystem over F155. IEEE journal on selected areas in communication, Vol 11, No 5, 1993 804--813.]]Google Scholar
- Blake, I., Seroussi, G., and Smart N. Elliptic Curves in Cryptography. Cambridge University Press, 1999.]] Google ScholarDigital Library
- Edoh K. D., and Wahab H. Multicast security: Issues and new schemes for key management. Proceedings of 2003 Information Resource Management Association International Conference, 2003, 123--126.]]Google Scholar
- Hankerson, D., Hernandez, L. J., and Menezes A. Software implementation of elliptic curve cryptography over binary fields, CHESS 2000, LNCS 1965, 2000, 1--24.]] Google ScholarDigital Library
- Koblitz N. Elliptic curve cryptosystem. Mathematics in Computation. (48), 1987, 203--209.]]Google Scholar
- Koblitz N. A Course in Number Theory and Crytography, Springer Verlag. 2nd Ed, 1994.]] Google ScholarDigital Library
- Koblitz N. CM-curves with good cryptographic properties. Advances in Cryptology-CRYPTO '91. LNCS 576, Springer-Verlag, 1992, 279--287.]] Google ScholarDigital Library
- Koblitz N., Menezes A. J., and Vanstone S. A. The state of elliptic curve cryptography. Design, Codes, and Cryptography. Vol 19, Issue 2-3, 2000, 173--193.]] Google ScholarDigital Library
- Lenstra A., and Verheul E. Selecting cryptographic key sizes. Third International Workshop on Practice and Theory in Public Key Cryptography-PKC 2000. LNCS 1751, 2000.]] Google ScholarDigital Library
- Miller V. Use of elliptic curves in cryptography. Advances in Cryptography-Crypto '85. LNCS 218, Springer Verlag, 1986, 417--426.]] Google ScholarDigital Library
- Menezes A. J. Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, 1993.]] Google ScholarDigital Library
- Menezes A. J., van Oorschot P. C., and Vanstone S. A. Handbook of Applied Cryptography. CRC Press, 1997.]] Google ScholarDigital Library
- Menezes A. J., Teske E., and Weng A. Weak fields for ECC. CORR 2003-15, Technical Report, University of Waterloo, 2003.]]Google Scholar
- McEliece R. J. Finite Fields for Computer Scientists and Engineers Kluwer Academic Publishers, 1987.]] Google ScholarDigital Library
- Rivest R., Schamir A. and Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21, 1978, 120--126.]] Google ScholarDigital Library
- Schoof R. Elliptic curves over finite fields and the computation of square roots mod p. Math. Comp., 44, 1985, 483--494.]]Google Scholar
- Solinas J. An improved algorithm for arithmetic on a family of elliptic curves. Advances in Cryptology, Proc. Crypto '9. LNCS 1294 Kaliski B., Ed., Springer-Verlag, 1997, 357--371.]] Google ScholarDigital Library
- Solinas J. Efficient arithmetic on Koblitz curves. Design, Codes and Cryptography, 19, 2000, 195--249.]] Google ScholarDigital Library
- The openSSL project, http://www.openSSL.org. 1998-2003.]]Google Scholar
Index Terms
- Elliptic curve cryptography: Java implementation
Recommendations
An improvement of a elliptic curve digital signature algorithm
The elliptic curve digital signature algorithm ECDSA is the first successful algorithm based on elliptic curve and it is elliptic curve analogue of digital signature algorithm DSA. The security of this algorithm relies on intractability of elliptic ...
Elliptic curve cryptography: survey and its security applications
ACAI '11: Proceedings of the International Conference on Advances in Computing and Artificial IntelligenceElliptic curve cryptosystems are based on ECDLP (Elliptic curve discrete logarithm problem) for their security. The best known method to solve ECDLP (pollard's rho algorithm) is fully exponential therefore Elliptic Curve Cryptosystems require ...
Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
Proceedings of the 28th Annual International Conference on Advances in Cryptology - EUROCRYPT 2009 - Volume 5479Efficiently computable homomorphisms allow elliptic curve point multiplication to be accelerated using the Gallant-Lambert- Vanstone GLV method. We extend results of Iijima, Matsuo, Chao and Tsujii which give such homomorphisms for a large class of ...
Comments