Design of flexible GF(2m) elliptic curve cryptography processors

  • Authors:
  • Mohammed Benaissa;Wei Ming Lim

  • Affiliations:
  • Department of Electronic and Electrical Engineering, University of Sheffield, Sheffield, U.K;Department of Electronic and Electrical Engineering, University of Sheffield, Sheffield, U.K

  • Venue:
  • IEEE Transactions on Very Large Scale Integration (VLSI) Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The design of flexible elliptic curve cryptography processors (ECP) is considered in this paper. Novel word-level algorithms and implementations for the underlying GF(2m) multiplication and squaring arithmetic which enable improved flexibility versus performance tradeoffs, are presented and employed in the design of an efficient flexible ECP architecture; corresponding field-programmable gate-array (FPGA) prototyping results for two different processor word lengths are also included for evaluation.