Home

Fast implementation of Elliptic Curve Arithmetic in GF(p m


Author(s) : Hyo Sun Hwang Chae Hoon Lim, 
Publisher : N/A
Publication Date : 2000
ISSN : N/A
Abstract : Abstract. Elliptic curve cryptosystems have attracted much attention in recent years and one of major interests in ECC is to develop fast algorithms for eld/elliptic curve arithmetic. In this paper we present various improvement techniques for eld arithmetic in GF(p n)(p a prime), in particular, fast eld multiplication and inversion algorithms, and provide our implementation results on Pentium II and Alpha 21164 microprocessors. 1,