Abstract
An efficient residue number system (RNS) iterative modular multiplication algorithm is proposed. Compared with the previous researches, the proposed algorithm is superior for implementing the modular exponentiation in RNS. Besides, the way to extend the proposed algorithm to fast modular exponentiation in RNS is also shown. Using the proposed extension technique, the algorithm can be easily and efficiently applied to any other square-and-multiply methods for fast modular exponentiation in RNS.
Sign-in/Register to access full text options 
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.
