Peer-Reviewed Journal Details
Mandatory Fields
Kerins, T;Marnane, WP;Popovici, EM
2007
January
Integration-The Vlsi Journal
Versatile hardware architectures for GF(p(m)) arithmetic in public key cryptography
Validated
()
Optional Fields
CHARACTERISTIC-3 CURVES FIELDS
40
28
35
In this paper new algorithms and versatile hardware architectures for generic computations of the type u = ab(p)/c, u = b(p)/c and u = ab/c in the Galois field GF(p(m)) 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. (C) 2006 Elsevier B.V. All rights reserved.
AMSTERDAM
0167-9260
10.1016/j.vlsi.2005.12.009
Grant Details