Research Article
An Arithmetic over GF (2^5) To Implement in ECC
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 39 - Issue 11 |
| Published: February 2012 |
| Authors: A. R. Rishivarman, M. Thiagarajan B. Parthasarathy |
10.5120/4863-7204
|
A. R. Rishivarman, M. Thiagarajan B. Parthasarathy . An Arithmetic over GF (2^5) To Implement in ECC. International Journal of Computer Applications. 39, 11 (February 2012), 18-22. DOI=10.5120/4863-7204
@article{ 10.5120/4863-7204,
author = { A. R. Rishivarman,M. Thiagarajan B. Parthasarathy },
title = { An Arithmetic over GF (2^5) To Implement in ECC },
journal = { International Journal of Computer Applications },
year = { 2012 },
volume = { 39 },
number = { 11 },
pages = { 18-22 },
doi = { 10.5120/4863-7204 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2012
%A A. R. Rishivarman
%A M. Thiagarajan B. Parthasarathy
%T An Arithmetic over GF (2^5) To Implement in ECC%T
%J International Journal of Computer Applications
%V 39
%N 11
%P 18-22
%R 10.5120/4863-7204
%I Foundation of Computer Science (FCS), NY, USA
Abstract
The potential for the use of the discrete logarithm problem in public-key cryptosystems has been recognized by Diffe and Hellman in 1976. Although the discrete logarithm problem as first employed by them was defined explicitly as the problem of finding logarithms with respect to a generator in the multiplicative group of the integers module a prime, this idea can be extended to arbitrary groups and in particular, to elliptic curve groups. The resulting public – key systems provide relatively small block size, high speed, and high security. In this paper an efficient arithmetic for operations over elements of GF(25) represented in normal basis is presented. The arithmetic is applicable in public-key cryptography.
References
- G.B. Agnew, R.C. Mullin, I.M. Onyszchuk, and S.A.Vanstone, “An Implementation for a Fast Public-Key Cryptosystem,” Journal of Cryptology, vol. 3, pp.63-79, 1999
- IEEE 1363. Standard for Public-key Cryptography., IEEE 2000
- Itoh, Teechai, and Tsujii, “A Fast Algorithm for Computing Multiplicative Inverses in GF(2t) using normal bases,” J. Society for Electronic Communications (Japan), vol.44, pp.31-36, 1986
- P.H.W Leong and K.H. Leung, “A Micro coded Elliptic Curve Processor Using FPGA Technology,” IEEE Transactions on VLSI Systems, vol. 10, no. 5, pp. 550-559, Oct. 2002
- J. Massey, and J. Omura, “Computational Method and Apparatus for Finite Field Arithmetic,” U.S. patent number 4,587,627, 1986
- I. Blake, G. Seroussi and N. Smart, “Elliptic Curves in Cryptography”, Chapter 1. Cambridge University Press, Cambridge (UK), 1999
- N.Koblitz, Introduction to Elliptic Curves and Modular Forms, 2nd Ed., Spinger-Verlag,1993.
- N.Koblitz, Elliptic Curve Cryptosystems, Math.Compu.Vol.48,No.177, Jan,1987,pp 203-209.
- A.R.Rishivarman, B.Parthsarathy, M.Thiagarajan, “An efficient performance of GF(2^5) arithmetic in the elliptic curve cryptosytem”, International journal of computing and application, vol 4 no. 2 pp 111-116, 2009
- A.R.Rishivarman, B.Parthsarathy, M.Thiagarajan, “A key sharing scheme over GF(2^5)”, Springer-CCIS, vol 283 2012
- A.R.Rishivarman, B.Parthasarathy, M.Thiagarajan, “A Montgomery representation of elements in GF(2^5) for efficient arithmetic to use in elliptic curve cryptography”, International journal of advanced networking and application, vol 1 no. 5 pp 323-326, 2010
Index Terms
Keywords