Fast Implementation of Elliptic Curve Arithmetic in GF(pn)

  • Chae Hoon Lim
  • Hyo Sun Hwang
Conference paper

DOI: 10.1007/978-3-540-46588-1_27

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1751)
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

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

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Chae Hoon Lim
    • 1
  • Hyo Sun Hwang
    • 1
  1. 1.Future Systems, Inc.Information and Communications Research CenterSeoulKorea

Personalised recommendations