Abstract
Finite field arithmetic operations have been widely used in the areas of network security and data communication applications, and high-speed and low-complexity design for finite field arithmetic is very necessary for these applications. The current paper presents a new AB 2 algorithm along with its systolic implementations in GF(2m). The proposed algorithm is based on the MSB-first scheme using the standard basis representation. In addition, parallel-in parallel-out systolic architectures are also introduced using this algorithm as a foundation. The proposed architectures have a low hardware complexity and small latency compared to conventional architectures. In particular, the hardware complexity of AB 2 and inversion/division array are about 25% lower than Wang's over GF(2m), while the latency of AB 2 and inversion/ division array are about 40% and 49.6% lower, respectively. Furthermore, since the proposed architectures incorporate simplicity, regularity, modularity, and pipelinability, they are well suited to VLSI implementation and can also be utilized as the basic architecture for a crypto-processor.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
W.W. Peterson, E.J. Weldon: Error-correcting codes. MIT Press, MA (1972)
D.E.R. Denning: Cryptography and data security. Addison-Wesley, MA (1983)
IEEE P1363/D9(Draft Version 9): Standard Specifications for Public Key Cryptography, IEEE standards Draft, USA (1999)
T. ElGamal: A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans. on Info. Theory, vol. 31(4) (1985) 469–472
I.S. Reed and T.K. Truong: The use of finite fields to compute convolutions. IEEE Trans. Inform. Theory, 21 (1975) 208–213
W.C. Tsai, S.-J. Wang: Two systolic architectures for multiplication in GF(2m). IEE Proc. Cmput. Digit. Tech, Vol. 147 (2000) 375–382
S. G. Moon, J.M. Park, Y. S. Lee: Fast VLSI arithmetic algorithms for highsecurity elliptic curve cryptographic applications. IEEE Transactions on Consumer Electronics, Vol. 47, No. 3 (2001) 700–708
S.K. Jain, L. Song, K.K. Parhi: Efficient semisystolic architectures for finite field arithmetic, IEEE Trans. VLSI Syst. (1995) 101–113
C.Y. Lee, E.H. Lu, L.F. Sun: Low-complexity Bit-parallel Systolic Architecture for Computing AB 2 + C in a Class of Finite Field GF(2m), IEEE Trans. On Circuits and Systems, Vol. 48 (2001) 519–523
C.H. Liu, N.F. Huang, C.Y. Lee: Computation of AB 2 Multiplier in GF(2m) Using an Efficient Low-Complexity Cellular Architecture, IEICE Trans. Fundamentals, Vol. E83-A, (2000) 2657–2663
S.W. Wei: A Systolic Power-Sum Circuit for GF(2m). IEEE Trans. Computers. 43 (1994) 226–229
C.L. Wang and J.H. Guo: New systolic arrays for C+AB 2, inversion, and division in GF(2m). IEEE Trans. Computers 49 (2000) 1120–1125
13. S. W.Wei: VLSI Architectures for Computing Exponentiations, Multiplicative Inverses, and Divisions in GF(2m). Proc. 1995 IEEE Int’l Symp. Circuits and Systems (1995) 203–206
S. Y. Kung: VLSI Array Processors. Prentice-Hall. 43 (1987)
K. Y. Yoo: A Systolic Array Design Methodology for Sequential Loop Algorithms. Ph.D. thesis, Rensselaer Polytechnic Institute, New York (1992)
Daniel D. Gajski: Principles of Digital Design. Prentice-Hall international, INC. (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nam-Yeun, K., Dae-Ghon, K., Kee-Young, Y. (2002). Inversion/Division Systolic Architecture for Public-Key Cryptosystems in GF(2m). In: Chan, A.H., Gligor, V. (eds) Information Security. ISC 2002. Lecture Notes in Computer Science, vol 2433. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45811-5_22
Download citation
DOI: https://doi.org/10.1007/3-540-45811-5_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44270-7
Online ISBN: 978-3-540-45811-1
eBook Packages: Springer Book Archive