Abstract
Exponentiation in the Galois Field GF(2m) is a primary operation for public key cryptography, such as the Diffie-Hellman key exchange, ElGamal. The current paper presents a new architecture that can simultaneously process modular multiplication and squaring using the Montgomery algorithm over GF(2 m) in m clock cycles based on a cellular automata. The proposed architecture makes use of common-multiplicand multiplication in LSB-first modular exponentiation over GF(2m). In addition, modular exponentiation, division, and inversion architecture can also be implemented, and since cellular automata architecture is simple, regular, modular, and cascadable, it can be utilized efficiently for the implementation of VLSI.
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
McEliece, R.J.: Finite Fields for Computer Scientists and Engineers. Kluwer Academic, New York (1987)
Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. on Info. Theory 22, 644–654 (1976)
ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. on Info. Theory 31(4), 469–472 (1985)
Menezes, A.J.: Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, Dordrecht (1993)
Yeh, C.-S., Reed, I.S., Truong, T.K.: Systolic Multipliers for Finite Fields GF(2m). IEEE Transactions On Computers C-33(4), 357–360 (1984)
Wang, C.L., Lin, J.L.: Systolic Array Implementation of Multipliers for Finite Fields GF(2m). IEEE Transactions On Circuits And Systems 38(7), 796–800 (1991)
Montgomery, P.L.: Modular multiplication without trial division. Mathematics of Computation 44(170), 519–521 (1985)
Delorme, M., Mazoyer, J.: Cellular Automata. Kluwer academic Publishers, Dordrecht (1999)
Wolfram, S.: Cellular Automata and Complexity. Addison-Wesley Publishing Company, Reading (1994)
Lee, W.H., Lee, K.J., Yoo, K.Y.: Design of a Linear Systolic Array for Computing Modular Multiplication and Squaring in GF(2m). Computer and Mathematics with Applications 42, 231–240 (2001)
Koç, Ç.K., Acar, T.: Montgomery Multiplication in GF(2k). Kluwer Academic Publishers, Designs, Codes and Cryptography 14(1), 57–69 (1998)
Knuth, The Art of Computer programming, Vol. 2/Seminumerical Algorithms, Addison-Wesley (1969)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ku, K.M., Ha, K.J., Yoo, W.H., Yoo, K.Y. (2004). Parallel Montgomery Multiplication and Squaring over GF(2m) Based on Cellular Automata. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24768-5_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-24768-5_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22060-2
Online ISBN: 978-3-540-24768-5
eBook Packages: Springer Book Archive