Abstract
Finite field multiplication in GF(2m) is an ineluctable operation in elliptic curve cryptography. The objective of this paper is to survey fast and efficient hardware implementations of systolic and semisystolic finite field multipliers in GF(2m) with two algorithmic schemes – LSB-first and MSB-first. These algorithms have been mapped to seven variants of recently proposed array-type finite-field multiplier implementations with different input-output configurations. The relative VLSI performance merits of these ASIC prototypes with respect to their field orders are evaluated and compared under uniform constraints and in properly defined simulation runs on a Synopsys environment using the TSMC 0.18μm CMOS standard cell library. The results of the simulation provide an insight into the behavior of various configurations of array-type finite-field multiplier so that system architect can use them to determine the most appropriate finite field multiplier topology for required design features.
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.
References
Schneier, B.: Applied Cryptography, 2nd edn. Wiley, Chichester (1996)
Menezes, A.: Elliptic Curve Public Key Cryptography. Kluwer Academic Publishers, Dordrecht (1993)
Hankerson, D., Hernandez, J.L., Menezes, A.: Software Impelementation of elliptic curve cryptography over binary fields. In: Cryptographic Hardware and Embedded Systems, pp. 1–24. Springer, Heidelberg (2000)
Eberle, H., Gura, N., Chang-Shantz, S.: A cryptographic processor for arbitrary elliptic curves over GF(2m). In: Proc. IEEE Intl. Conf. on Application-Specific Systems, Architectures, and Processors, Hague, Netherlands, June 2003, pp. 444–454 (2003)
Hasan, M.A., Wang, M.Z., Bhargava, V.K.: A modified Massey-Omura parallel multiplier for a class of finite fields. IEEE Trans. on Computers 42(10), 1278–1280 (1993)
Zhang, T., Parhi, K.K.: Systematic design of original and modified mastrovito multipliers for general irreducible polynomials. IEEE Trans. on Computers 50(7), 734–749 (2001)
Mastrovito, E.D.: VLSI designs for multiplication over finite fields GF(2m). In: Proc. Sixth Intl. Conf. Applied Algebra, Algebraic Algorithms, and Error–Correcting Codes (AAECC 1988), Rome, Italy, July 1988, pp. 297–309 (1988)
Halbutogullari, A., Koc, C.K.: Mastrovito Multiplier for general irreducible polynomials. In: Fossorier, M.P.C., Imai, H., Lin, S., Poli, A. (eds.) AAECC 1999. LNCS, vol. 1719, pp. 498–507. Springer, Heidelberg (1999)
Reyhani-Masoleh, A., Hasan, M.A.: Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m). IEEE Trans. on Computers 53(8), 945–958 (2004)
Jain, S.K., Parhi, K.K.: Low latency standard basis GF(2m) multiplier and squarer architectures. In: Proc. IEEE Intl. Conf. on Acoustic, Speech and Signal Processing (ICASSP 1995), Detroit, Michigan, USA, May 1995, pp. 2747–2750 (1995)
Jain, S.K., Song, L., Parhi, K.K.: Efficient semisystolic architectures for finite-field arithmetic. IEEE Trans. on Very Large Scale Intergration (VLSI) Systems 6(1), 101–113 (1998)
Wang, C.-L., Lin, J.-L.: Systolic array implementation of multipliers for finite fields GF(2m). IEEE Trans. on Circuits and Systems-I 38(7), 796–800 (1991)
Guo, J.-H., Wang, C.-L.: Digit-serial systolic multiplier for finite fields pGF(2m). IEE Proc. Comput. Digit. Tech. 145(2), 143–148 (1998)
Kim, K.-W., Lee, K.-J., Yoo, K.-Y.: A new digit-serial multiplier for finite fields GF(2m). In: Proc. of Info-tech and Info-net (ICII 2001), Beijing, China, vol. 5, pp. 128–133 (2001)
Kim, C.H., Han, S.D., Hong, C.P.: An efficient digit-serial systolic multiplier for finite fields GF(2m). In: Proc. of 14th Annual IEEE Intl. ASIC/SOC Conference, September 2001, pp. 361–165 (2001)
Lopez, J., Dahab, R.: An overview of elliptic curve cryptography, Technical Report, Institute of Computing, State Uniersity of Campinas (May 2000)
Certicom Research, SEC: 2: Recommended elliptic curve domain parameters, Standards for Efficient Cryptography, Technical document, September 20 (2000)
Laws, B.A., Rushforth, C.K.: A cellular-array multiplier for GF(2m). IEEE Trans. on Computers 20, 869–874 (1982)
Lidl, R., Niederreiter, H.: Introduction to finite fields and their applications, Revised Edition. Cambridge University Press, Cambridge (1994)
Nedjah, N., de Macedo Mourelle, L.: A reconfigurable recursive and efficient hardware for Karatsuba-Ofman’s multiplication algorithm. In: Proc. IEEE Int. Conf. on Control Applications (ICCA 2003), Istanbul, Turkey, June 2003, vol. 2, pp. 1076–1081 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Satzoda, R.K., Chang, CH. (2005). VLSI Performance Evaluation and Analysis of Systolic and Semisystolic Finite Field Multipliers. In: Srikanthan, T., Xue, J., Chang, CH. (eds) Advances in Computer Systems Architecture. ACSAC 2005. Lecture Notes in Computer Science, vol 3740. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11572961_56
Download citation
DOI: https://doi.org/10.1007/11572961_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29643-0
Online ISBN: 978-3-540-32108-8
eBook Packages: Computer ScienceComputer Science (R0)