Fully Parameterizable Elliptic Curve Cryptography Processor over GF(2)

Authors:
Tim Kerins;Emanuel Popovici;William P. Marnane;Patrick Fitzpatrick
Affiliations:
-;-;-;-
Venue:
FPL '02 Proceedings of the Reconfigurable Computing Is Going Mainstream, 12th International Conference on Field-Programmable Logic and Applications
Year:
2002

Citing 5
Cited 5

Use of elliptic curves in cryptography

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Elliptic curves in cryptography

Elliptic curves in cryptography
A High Performance Reconfigurable Elliptic Curve Processor for GF(2m)

CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
Software Implementation of Elliptic Curve Cryptography over Binary Fields

CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
FPGA Implementation of a Microcoded Elliptic Curve Cryptographic Processor

FCCM '00 Proceedings of the 2000 IEEE Symposium on Field-Programmable Custom Computing Machines

A Custom Instruction Approach for Hardware and Software Implementations of Finite Field Arithmetic over $$\mathbb{F}_{{2^{{163}} }} $$ using Gaussian Normal Bases

Journal of VLSI Signal Processing Systems
High Speed Compact Elliptic Curve Cryptoprocessor for FPGA Platforms

INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
Efficient finite field processor for GF(2163) and its implementation

International Journal of High Performance Systems Architecture
Customizable elliptic curve cryptosystems

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Design of a high performance Binary Edwards Curve based processor secured against side channel analysis

Integration, the VLSI Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present an Elliptic Curve Point Multiplication processor over base fields GF(2m), suitable for use in a wide range of commercial cryptography applications. Our design operates in a polynomial basis is fully parameterizable in the irreducible polynomial and the chosen Elliptic Curve over any base Galois Field up to a given size. High performance is achieved by use of a dedicated Galois Field arithmetic coprocessor implemented on FPGA. The underlying FPGA architecture is used to increase calculation performance, taking advantage of the properties of this kind of programmable logic device to perform the large number of logical operations required. We discuss the performance of our processor for different Elliptic Curves and compare the results with recent implementations in terms of speed and security.