By Topic

High-performance, low-power architecture for scalable radix 2 montgomery modular multiplication algorithm

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
$33 $13
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)
Atef Ibrahim ; Department of Electrical and Computer Engineering, University of Victoria, Victoria, British Columbia V8W 3P6, Canada as well as the Microelectronics Department of Electronics Research Institute, Egypt ; Fayez Gebali ; Hamed El-Simary ; Amin Nassar

This paper presents a new processor array architecture for scalable radix 2 Montgomery modular multiplication algorithm. In this architecture, the multiplicand and the modulus words are allocated to each processing element rather than pipelined between the processing elements as in the previous architecture extracted by C. Koc. Also, the multiplier bits are fed serially to the first processing element of the processor array every odd clock cycle. By analyzing this architecture, we found that it has a better performance-in terms of area and speed-and lower power consumption than the previous architecture extracted by Ç. Koç.

Published in:

Canadian Journal of Electrical and Computer Engineering  (Volume:34 ,  Issue: 4 )