Abstract
Montgomery multiplication in GF(2m) is defined by a(x)b(x)r -1(x) mod f(x), where the field is generated by irreducible polynomial f(x), a(x) and b(x) are two field elements in GF(2m), and r(x) is a fixed field element in GF(2m). In this paper, first we present a general- ized Montgomery multiplication algorithm in GF(2m). Then by choosing r(x) according to f(x), we show that efficient architecture for bit-parallel Montgomery multiplier and squarer can be obtained for the fields gen- erated with irreducible trinomials. Complexities in terms of gate counts and time propagation delay of the circuits are investigated and found to be comparable to or better than that of polynomial basis or weakly dual basis multiplier for the same class of fields.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
C. K. Koc and T. Acar. Montgomery multiplication in GF(2k). Designs, Codes and Cryptography, 14:57–69, 1998.
P. L. Montgomery. Modular multiplication without trial division. Mathematics of Computation, 44:519–521, 1985.
B. Sunar and C. K. Koc. Mastrovito multiplier for all trinomials. IEEE Trans. Comput., 48(5):522–527, 1999.
M. Wang and I. F. Blake. Bit serial multiplication in finite fields. SIAM Discrete Mathematics, 3(1):140–148, 1990.
H. Wu. Low-complexity arithmetic in finite field using polynomial basis. In CHES’99, pages 357–371. Springer-Verlag, 1999.
H. Wu, M. A. Hasan, and I. F. Blake. Low complexity weakly dual basis bit-parallel multiplier over finite fields. IEEE Trans. Comput., 47(11):1223–1234, November 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, H. (2000). Montgomery Multiplier and Squarer in GF(2m). In: Koç, Ç.K., Paar, C. (eds) Cryptographic Hardware and Embedded Systems — CHES 2000. CHES 2000. Lecture Notes in Computer Science, vol 1965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44499-8_21
Download citation
DOI: https://doi.org/10.1007/3-540-44499-8_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41455-1
Online ISBN: 978-3-540-44499-2
eBook Packages: Springer Book Archive