VLSI algorithms, architectures, and implementation of a versatile GF(2(m))processor

Citation
Ma. Hasan et Ag. Wassal, VLSI algorithms, architectures, and implementation of a versatile GF(2(m))processor, IEEE COMPUT, 49(10), 2000, pp. 1064-1073
Citations number
22
Categorie Soggetti
Computer Science & Engineering
Journal title
IEEE TRANSACTIONS ON COMPUTERS
ISSN journal
00189340 → ACNP
Volume
49
Issue
10
Year of publication
2000
Pages
1064 - 1073
Database
ISI
SICI code
0018-9340(200010)49:10<1064:VAAAIO>2.0.ZU;2-E
Abstract
With the explosive growth of electronic commerce, dedicated cryptographic p rocessors are becoming essential since general-purpose processors cannot pr ovide the performance and functionality direly needed. This paper proposes an architecture for a versatile Galois field GF(2(m)) processor for cryptog raphic applications. This processor uses both canonical and triangular base s for field elements representation and manipulation. The variable dimensio n datapath of the processor is versatile enough to meet the varying require ments for different applications and environments. To provide flexibility f or different cryptographic applications, an instruction set architecture is designed. Finally, a prototype VLSI implementation of the Galois field pro cessor is presented and discussed.