Versatile hardware architectures for GF(pm) arithmetic in public key cryptography

Authors:
T. Kerins;W. P. Marnane;E. M. Popovici
Affiliations:
Department of Electrical and Electronic Engineering University College Cork, Ireland;Department of Electrical and Electronic Engineering University College Cork, Ireland;Department of Microelectronic Engineering, University College Cork, Ireland
Venue:
Integration, the VLSI Journal - Special issue: Embedded cryptographic hardware
Year:
2007

Citing 6
Cited 0

Elliptic curves in cryptography

Elliptic curves in cryptography
Elliptic Curve Public Key Cryptosystems

Elliptic Curve Public Key Cryptosystems
Hardware Implementation of Finite Fields of Characteristic Three

CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Hardware and Software Normal Basis Arithmetic for Pairing-Based Cryptography in Characteristic Three

IEEE Transactions on Computers
Efficient GF(pm) arithmetic architectures for cryptographic applications

CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Algorithm and architecture for a Galois field multiplicative arithmetic processor

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper new algorithms and versatile hardware architectures for generic computations of the type u = abp/c, u = bp/c and u = ab/c in the Galois field GF(pm) are described. In all cases the hardware operates independently of the defining irreducible polynomial of the field and the same hardware can be used for different field sizes offering full versatility up to a maximum field size. The performance of prototype implementations over Galois fields of characteristic p = 3 are discussed through FPGA implementation.