Combined circuit architecture for computing normal basis and Montgomery multiplications over GF(2^m)
by Chiou-Yng Lee, Chia-Chen Fan, Erl-Huei Lu
International Journal of Autonomous and Adaptive Communications Systems (IJAACS), Vol. 4, No. 3, 2011

Abstract: This work presents a novel combined circuit architecture for computing normal basis (NB) and Montgomery multiplications, which is based on a Hankel matrix approach. Analytical results reveal that the proposed multiplier has lower space complexity than existing systolic multipliers. Moreover, by using the combined circuit architecture, the proposed scalable multiplier over the composite fields is also presented. Analytical results reveal that the proposed multiplier has lower space complexity than existing systolic NB and Montgomery multipliers. Moreover, the proposed architecture is regular, modular and locally interconnectable, making it well suited for implementing VLSI.

Online publication date: Sat, 24-Jan-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Autonomous and Adaptive Communications Systems (IJAACS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com