Abstract
Most current cryptosystems need to compute modular multiplication with large numbers. Modular multiplication is a time-consuming operation, and thus many different techniques have been proposed for the acceleration. A novel approach, residue number system (RNS), which has the advantages of parallel, carry-free, and high-speed arithmetic, is usually used for large number computations. However, division and the magnitude comparison, which most modular multiplication algorithms involve, are difficult to be processed in RNS. In this paper, we present an iterative modular multiplication algorithm in RNS. A subtle iterative model, eliminating division and the magnitude comparison in modular multiplications, proposed by Chiou and Yang, and improved further by Leong et al., can be used to achieve our purpose. Our new algorithm has the property of easy parallelization and is more efficient than other iterative modular multiplication algorithms proposed previously.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
