Design of flexible GF(2/sup m/) elliptic curve cryptography processors
Mohammed Benaissa, W.M. Lim · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · 2006
The design of flexible elliptic curve cryptography processors (ECP) is considered in this paper. Novel word-level algorithms and implementations for the underlying GF(2/sup m/) 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.