Generation of Finely-Pipelined GF(P ) Multipliers for Flexible Curve based Cryptography on FPGAs - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Computers Year : 2019

Generation of Finely-Pipelined GF(P ) Multipliers for Flexible Curve based Cryptography on FPGAs

Abstract

In this paper, we present modular multipliers for hardware implementations of (hyper)-elliptic curve cryptography on FPGAs. The prime modulus P is generic and can be configured at run-time to provide flexible circuits. A finely-pipelined architecture is proposed for overlapping the partial products and reductions steps in the pipeline of hardwired DSP slices. For instance, 2, 3, or 4 independent multiplications can share the hardware resources at the same time to overlap internal latencies. We designed a tool, distributed as open source, for generating VHDL codes with various parameters: width of operands, number of logical multipliers per physical one, speed or area optimization, possible use of BRAMs, target FPGA. Our modular multipliers lead to, at least, 2 times faster as well as 2 times smaller circuits than state of the art operators.
Fichier principal
Vignette du fichier
tc-htmm.pdf (1 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02141260 , version 1 (27-05-2019)

Identifiers

Cite

Gabriel Gallin, Arnaud Tisserand. Generation of Finely-Pipelined GF(P ) Multipliers for Flexible Curve based Cryptography on FPGAs. IEEE Transactions on Computers, 2019, 68 (11), pp.1612-1622. ⟨10.1109/TC.2019.2920352⟩. ⟨hal-02141260⟩
281 View
424 Download

Altmetric

Share

Gmail Facebook X LinkedIn More