Abstract
AbstractModular multiplication is fundamental to several public-key cryptography systems such as the RSA encryption system. It is also the most dominant part of the computation performed in such systems. The operation is time consuming for large operands. This paper examines the characteristics of yet another architecture to implement modular multiplication. It interleaves Booth's multiplication and Barrett's reduction methods. The functionality of the Booth-Barrett proposed multiplier is accessed through simulation and its performance is evaluated by comparing it to a Montgomery-based modular multiplier. The comparative analysis shows that the proposed multiplier performs considerably better than the Montgomery multiplier when the operand size is smaller than 512. However, when this size gets closer to 1024, the performance of the Booth-Barrett multiplier degrades relative to that of the Montgomery-based modular multiplier.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
