Abstract
The key operations for the public-key cryptosystems are modular inversion, division, and exponentiation. The modular multiplication is considered to be the basic arithmetic for them. This paper proposes a new algorithm and it’s semi-systolic array architecture to compute the modular multiplication over GF(2m). They are based on the standard basis representation and use the property of irreducible all one polynomial as a modulus. The architecture has the critical path with 1-D XOR per cell and has the latency with m+1. These properties are better than the existing multipliers. Since the proposed multiplier has regularity, modularity and concurrency, it is suitable for VLSI implementation and can be easily utilized for the crypto-processor chip design.
This research was supported by Ministry of Knowledge and Economy, Republic of Korea, under the ITRC(Information Technology Research Center) support program supervised by IITA(Institute for Information Technology Advancement)(IITA-2008-C1090-0801-0004).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Peterson, W.W., Weldon, E.J.: Error-correcting codes. MIT Press, MA (1972)
Denning, D.E.R.: Cryptography and data security. Addison-Wesley, Reading (1983)
Menezes, A.: Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, Boston (1993)
Reed, I.S., Truong, T.K.: The use of finite fields to compute convolutions. IEEE Trans. Inform. Theory 21, 208–213 (1975)
Kim, H.S.: Bit-Serial AOP Arithmetic Architecture for Modular Exponentiation, PhD. Thesis, Kyungpook National University (2002)
Wei, S.W.: VLSI architectures for computing exponentiations, multiplicative inverses, and divisions in GF(2m). IEEE Trans. Circuits and Systems 44, 847–855 (1997)
Yeh, C.S., Reed, S., Truong, T.K.: Systolic multipliers for finite fields GF(2m). IEEE Trans. Comput. C-33, 357–360 (1984)
Wang, C.L., Lin, J.L.: Systolic Array Implementation of Multipliers for Finite Fields GF(2m). IEEE Trans. Circuits and Systems 38, 796–800 (1991)
Jain, S.K., Song, L.: Efficient Semi-systolic Architectures for finite field Arithmetic. IEEE Trans. on VLSI Systems 6(1) (March 1998)
Kim, H.S.: Efficient Systolic Architecture for Modular Multiplication over GF(2m). IMM-Technical report-2005-09, pp. 104–110 (2005)
Itoh, T., Tsujii, S.: Structure of parallel multipliers for a class of finite fields GF(2m). Info. Comp. 83, 21–40 (1989)
Kung, S.Y.: VLSI Array Processors. Prentice-Hall, Englewood Cliffs (1987)
Yoo, K.Y.: A Systolic Array Design Methodology for Sequential Loop Algorithms, PhD. thesis, Rensselaer Polytechnic Institute, New York (1992)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, HS., Lee, SW. (2008). Semi-systolic Modular Multiplier over GF(2m). In: Gervasi, O., Murgante, B., Laganà, A., Taniar, D., Mun, Y., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2008. ICCSA 2008. Lecture Notes in Computer Science, vol 5073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69848-7_66
Download citation
DOI: https://doi.org/10.1007/978-3-540-69848-7_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69840-1
Online ISBN: 978-3-540-69848-7
eBook Packages: Computer ScienceComputer Science (R0)