DocumentCode
3426028
Title
A (4:2) adder for unified GF (p) and GF (2n) Galois field multipliers
Author
Au, Lai Sze ; Burgess, Neil
Author_Institution
Sch. of Eng., Cardiff Univ., UK
Volume
2
fYear
2002
fDate
3-6 Nov. 2002
Firstpage
1619
Abstract
This paper describes a new redundant binary adder that supports carry-save additions under either of the Galois fields, GF(p) or GF(2/sup n/), without the need for an external control signal to specify which field is to be used. The proposed adder will find use in unified Galois field multipliers for cryptographic applications. Its main advantage over previously reported adders is that a control signal which is broadcast to all cells to suppress carries under GF(2/sup n/) is not needed, leading to a substantial gain in implementation efficiency.
Keywords
Galois fields; adders; cryptography; digital arithmetic; carry-save additions; cryptographic applications; implementation efficiency; redundant binary adder; unified Galois field multipliers; Adders; Arithmetic; Broadcasting; Circuits; Control systems; Elliptic curves; Galois fields; Gold; Latches; Registers;
fLanguage
English
Publisher
ieee
Conference_Titel
Signals, Systems and Computers, 2002. Conference Record of the Thirty-Sixth Asilomar Conference on
Conference_Location
Pacific Grove, CA, USA
ISSN
1058-6393
Print_ISBN
0-7803-7576-9
Type
conf
DOI
10.1109/ACSSC.2002.1197051
Filename
1197051
Link To Document