The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2002 vol.51)
pp: 521-529
ABSTRACT
<p>Montgomery multiplication in {\rm GF}(2^m) is defined by a(x)b(x)r^{-1}(x)\bmod{f(x)}, where the field is generated by a root of the irreducible polynomial f(x), a(x) and b(x) are two field elements in {\rm GF}(2^m), and r(x) is a fixed field element in {\rm GF}(2^m). In this paper, first, a slightly generalized Montgomery multiplication algorithm in {\rm GF}(2^m) is presented. Then, by choosing r(x) according to f(x), we show that efficient architectures of bit-parallel Montgomery multiplier and squarer can be obtained for the fields generated with an irreducible trinomial. Complexities of the Montgomery multiplier and squarer in terms of gate counts and time delay of the circuits are investigated and found to be as good as or better than that of previous proposals for the same class of fields.</p>
INDEX TERMS
Finite fields arithmetic, hardware architecture, Montgomery multiplication, elliptic curve cryptography
CITATION
H. Wu, "Montgomery Multiplier and Squarer for a Class of Finite Fields", IEEE Transactions on Computers, vol.51, no. 5, pp. 521-529, May 2002, doi:10.1109/TC.2002.1004591
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool