Fast point multiplication on Koblitz curves: Parallelization method and implementations

  • Authors:
  • Kimmo Järvinen;Jorma Skyttä

  • Affiliations:
  • Helsinki University of Technology, Department of Signal Processing and Acoustics, Otakaari 5A, FIN-02150 Espoo, Finland;Helsinki University of Technology, Department of Signal Processing and Acoustics, Otakaari 5A, FIN-02150 Espoo, Finland

  • Venue:
  • Microprocessors & Microsystems
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Point multiplication is required in every elliptic curve cryptosystem and its efficient implementation is essential. Koblitz curves are a family of curves defined over F"2"^"m allowing notably faster computation. We discuss implementation of point multiplication on Koblitz curves with parallel field multipliers. We present a novel parallelization method utilizing point operation interleaving. FPGA implementations are described showing the practical feasibility of our method. They compute point multiplications on average in 4.9@ms, 8.1@ms, and 12.1@ms on the standardized curves NIST K-163, K-233, and K-283, respectively, in an Altera Stratix II FPGA.