Parallelism Level Analysis of Binary Field Multiplication on FPGAs
Abstract
This work describes a pipelined architecture targeting FPGA binary field multiplication. It comprises a generic real time crypto coprocessor able to operate over any field, without a specific vendor specific technology. A performance comparison of this synthesized coprocessor is presented for two major FPGA vendors. The results show that the parallelism levels, often applied as a key point for decision-making, do not affect the area and power consumption in a linear manner, instead, present the local optimal points tied to the technology adopted for deployment.
Keywords:
Parallel processing, Field programmable gate arrays, Elliptic curve cryptography, Hardware, Galois fields, Parallel architectures, Cryptography, Elliptic Curve Cryptography, Binary Field, Binary Field Multiplication, FPGA, Architecture
Published
2015-11-03
How to Cite
FARIAS, Luckas A.; ALBERTINI, Bruno C.; BARRETO, Paulo S. L. M..
Parallelism Level Analysis of Binary Field Multiplication on FPGAs. In: BRAZILIAN SYMPOSIUM ON COMPUTING SYSTEMS ENGINEERING (SBESC), 5. , 2015, Foz do Iguaçu/PR.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2015
.
p. 334-397.
ISSN 2237-5430.
