Scalable Normal Basis Arithmetic Unit for Elliptic Curve Cryptography

Authors

  • J. Schmidt
  • M. Novotný

DOI:

https://doi.org/10.14311/688

Keywords:

finite fields, normal base, multiplication, inversion, arithmetic unit

Abstract

The design of a scalable arithmetic unit for operations over elements of GF(2m) represented in normal basis is presented. The unit is applicable in public-key cryptography. It comprises a pipelined Massey-Omura multiplier and a shifter. We equipped the multiplier with additional data paths to enable easy implementation of both multiplication and inversion in a single arithmetic unit. We discuss optimum design of the shifter with respect to the inversion algorithm and multiplier performance. The functionality of the multiplier/inverter has been tested by simulation and implemented in Xilinx Virtex FPGA.We present implementation data for various digit widths which exhibit a time minimum for digit width D = 15.

Downloads

Download data is not yet available.

Downloads

Published

2005-01-02

How to Cite

Schmidt, J., & Novotný, M. (2005). Scalable Normal Basis Arithmetic Unit for Elliptic Curve Cryptography. Acta Polytechnica, 45(2). https://doi.org/10.14311/688

Issue

Section

Articles