By Topic

Scalable and systolic Montgomery multiplier over GF(2m) generated by trinomials

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Lee, C.-Y. ; Dept. of Comput. Inf. & Network Eng., Lunghwa Univ. of Sci. & Technol., Taoyuan ; Chiou, C.W. ; Lin, J.-M. ; Chang, C.-C.

A Montgomery's algorithm in GF(2m) based on the Hankel matrix-vector representation is proposed. The hardware architecture obtained from this algorithm indicates low-complexity bit-parallel systolic multipliers with irreducible trinomials. The results reveal that the proposed multiplier saves approximately 36% of space complexity as compared to an existing systolic Montgomery multiplier for trinomials. A scalable and systolic Montgomery multiplier is also developed by applying the block-Hankel matrix-vector representation. The proposed scalable systolic architecture is demonstrated to have significantly less time-area product complexity than existing digit-serial systolic architectures. Furthermore, the proposed architectures have regularity, modularity and local interconnectability, making the.m highly appropriate for VLSI implementation.

Published in:

Circuits, Devices & Systems, IET  (Volume:1 ,  Issue: 6 )