Fast Implementation of Elliptic Curve Arithmetic in GF(pn)
- Cite this paper as:
- Lim C.H., Hwang H.S. (2000) Fast Implementation of Elliptic Curve Arithmetic in GF(pn). In: Imai H., Zheng Y. (eds) Public Key Cryptography. PKC 2000. Lecture Notes in Computer Science, vol 1751. Springer, Berlin, Heidelberg
Elliptic curve cryptosystems have attracted much attention in recent years and one of major interests in ECC is to develop fast algorithms for field/elliptic curve arithmetic. In this paper we present various improvement techniques for field arithmetic in GF(pn)(p a prime), in particular, fast field multiplication and inversion algorithms, and provide our implementation results on Pentium II and Alpha 21164 microprocessors.