This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
VLSI Algorithms, Architectures, and Implementation of a Versatile GF(2m) Processor
October 2000 (vol. 49 no. 10)
pp. 1064-1073
ASCII Text
x 
 
M.a. Hasan, A.g. Wassal, "VLSI Algorithms, Architectures, and Implementation of a Versatile GF(2m) Processor," IEEE Transactions on Computers, vol. 49, no. 10, pp. 1064-1073, October, 2000.
 
 
BibTex
x
 
@article{ 10.1109/12.888042,
author = {M.a. Hasan and A.g. Wassal},
title = {VLSI Algorithms, Architectures, and Implementation of a Versatile GF(2m) Processor},
journal ={IEEE Transactions on Computers},
volume = {49},
number = {10},
issn = {0018-9340},
year = {2000},
pages = {1064-1073},
doi = {http://doi.ieeecomputersociety.org/10.1109/12.888042},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - VLSI Algorithms, Architectures, and Implementation of a Versatile GF(2m) Processor
IS - 10
SN - 0018-9340
SP1064
EP1073
EPD - 1064-1073
A1 - M.a. Hasan,
A1 - A.g. Wassal,
PY - 2000
KW - Galois (or finite) field processor
KW - cryptography
KW - canonical (or polynomial) basis
KW - triangular basis
KW - datapath
KW - VLSI implementation.
VL - 49
JA - IEEE Transactions on Computers
ER -
 

Abstract—With the explosive growth of electronic commerce, dedicated cryptographic processors are becoming essential since general-purpose processors cannot provide the performance and functionality direly needed. This paper proposes an architecture for a versatile Galois field GF(2m) processor for cryptographic applications. This processor uses both canonical and triangular bases for field elements representation and manipulation. The variable dimension datapath of the processor is versatile enough to meet the varying requirements for different applications and environments. To provide flexibility for different cryptographic applications, an instruction set architecture is designed. Finally, a prototype VLSI implementation of the Galois field processor is presented and discussed.

[1] M.A. Sirbu, “Credits and Debits on the Internet,” IEEE Spectrum, vol. 34, no. 2, pp. 23-29, Feb. 1997.
[2] C.H. Fancher, “In Your Pocket: Smartcards,” IEEE Spectrum, vol. 34, no. 2, pp. 47-53, Feb. 1997.
[3] R. Lidl and H. Niederreiter,An Introduction to Finite Fields and Their Applications.Cambridge: Cambridge Univ. Press, 1986.
[4] T. Hasegawa, J. Nakajima, and M. Matsui, “A Practical Implementation of Elliptic Curve Cryptosystem over GF($p$) on a 16-Bit Microcomputer,” Proc. First Int'l Workshop Practice and Theory in Public Key Cryptography, PKC '98, Feb. 1998.
[5] D. Naccache and D. M'Raïhi, “Cryptographic Smart Cards,” IEEE Micro, vol. 16, no. 3, pp. 14-24, June 1996.
[6] J.-F. Dhem, D. Veithen, and J.-J. Quisquater, “SCALPS: Smart Card for Limited Payment Systems,” IEEE Micro, vol. 16, no. 3, pp. 42-51, June 1996.
[7] G.B. Agnew, R.C. Mullin, and S.A. Vanstone, An Implementation of Elliptic Curve Cryptosystems over$F_{2^{155}}$ IEEE J. Selected Areas in Comm., vol. 11, no. 5, pp. 804-813, June 1993.
[8] M.A. Hasan and M. Ebtedaei, “Efiicient Architectures for Computations over Variable Dimensional Galois Fields,” IEEE Trans. Circuits and Systems–I. Fundamental Theory and Applications, vol. 45, no. 11, pp. 1,205-1,211, Nov. 1998.
[9] B. Green and G. Drolet, “A Universal Reed-Solomon Decoder Chip,” Proc. 16th Biennial Symp. Comm., pp. 327-330, May 1992.
[10] Y.R. Shayan, “Versatile Reed-Solomon Decoder,” PhD thesis, Concordia Univ., Montreal, Canada, 1990.
[11] M.A. Hasan and V.K. Bhargava, "Architecture for a Low Complexity Rate-Adaptive Reed-Solomon Encoder," IEEE Trans. Computers, vol. 44, no. 7, pp. 938-942, July 1995.
[12] M.A. Hasan, “Shift-Register Synthesis for Multiplicative Inversion over${\rm GF}(2^m)$,” Proc. Int'l Symp. Information Theory, p. 49, 1995.
[13] R.E. Blahut, Theory and Practice of Error Control Codes. Reading, Mass.: Addison-Wesley, 1984.
[14] R. Schroeppel, S. O'Malley, H. Orman, and O. Spatscheck, “A Fast Software Implementation for Arithmetic Operations in GF($2^n$),” Proc. Advances in Cryptology–CRYPTO '95, pp. 43-56, 1995.
[15] C.J. Zarowski, “Parallel Implementation of the Schur Berlekamp-Massey Algorithm on a Linearly Connected Processor Array,” IEEE Trans. Computers, vol. 44, no. 7, pp. 930-933, July 1995.
[16] E.D. Mastrovito, “VLSI Architectures for Computations in Galois Fields,” PhD thesis, Dept. of Electrical Eng., Linköping Univ., Sweden, 1991.
[17] G. Seroussi, “Table of Low-Weight Binary Irreducible Polynomials,” Technical Report HPL-98-135, Hewlett-Packard Laboratories, Palo Alto, Calif., Aug. 1998. http://www.hpl.hp.com/techreports/98HPL-98-135.html .
[18] S. Blake-Wilson, “SEC1: Elliptic Curve Cryptography,” Certicom Research, Working Draft Ver. 0.4, Toronto, Canada, Aug. 1999. http://www.secg.orgdrafts.htm.
[19] M.A. Hasan and A.G. Wassal, “A Variable Dimension Galois Field Coprocessor with a Double-Bases Approach,” Technical Report E&CE no. 2000-03, Univ. of Waterloo, Canada, 2000.
[20] N. Weste and K. Eshraghian, Principles of CMOS VLSI Design, Addison-Wesley, 1994.
[21] Synopsys, Inc., Synopsy Online Documentations v1998.08-1, 1998.
[22] E. De Win and B. Parneel, “Elliptic Curve Public-Key Cryptosystems—An Introduction,” State of the Art in Applied Cryptography–Course on Computer Security and Industrial Cryptography, pp. 131-141, Springer-Verlag, 1998.

Index Terms:
Galois (or finite) field processor, cryptography, canonical (or polynomial) basis, triangular basis, datapath, VLSI implementation.
Citation:
M.a. Hasan, A.g. Wassal, "VLSI Algorithms, Architectures, and Implementation of a Versatile GF(2m) Processor," IEEE Transactions on Computers, vol. 49, no. 10, pp. 1064-1073, Oct. 2000, doi:10.1109/12.888042
Usage of this product signifies your acceptance of the Terms of Use.