A Comparison on FPGA of Modular Multipliers Suitable for Elliptic Curve Cryptography over GF(p) for Specific p Values

Authors:
Mark Hamilton;William P. Marnane;Arnaud Tisserand
Affiliations:
-;-;-
Venue:
FPL '11 Proceedings of the 2011 21st International Conference on Field Programmable Logic and Applications
Year:
2011

Citing 0
Cited 1

A compact FPGA-based montgomery multiplier over prime fields

Proceedings of the 23rd ACM international conference on Great lakes symposium on VLSI

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we provide a comparison of different modular multipliers suitable for use in an elliptic curve processor, when working with a Mersenne prime modulus. Mersenne primes allow for the use of fast modular reduction techniques. Several multipliers are presented that can be implemented solely in slice logic. A design that makes use of the DSP48E blocks on Virtex 5 FPGAs is also described. The different multipliers are compared for speed, area and power consumption when implemented on a Virtex 5 FPGA.