Chapter

Public Key Cryptography

Volume 1751 of the series Lecture Notes in Computer Science pp 405-421

Fast Implementation of Elliptic Curve Arithmetic in GF(p n )

  • Chae Hoon LimAffiliated withFuture Systems, Inc., Information and Communications Research Center
  • , Hyo Sun HwangAffiliated withFuture Systems, Inc., Information and Communications Research Center

Abstract

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(p n )(p a prime), in particular, fast field multiplication and inversion algorithms, and provide our implementation results on Pentium II and Alpha 21164 microprocessors.