Abstract
The residue number system (RNS) with pairs of conjugate moduli uses a modulus set containing pairs of moduli of the form {2/sup k/-1, 2/sup k/+1}. This RNS provides a good trade-off between large dynamic range and channel width. It also supports efficient channel-width multiplication and addition as well as efficient conversions between weighted and RNS representations. This paper presents algorithms for exact scaling and Montgomery reduction in the RNS with pairs of conjugate moduli. The ability to perform these operations on very large integers suggest this RNS is suitable for the implementation of public key cryptosystems.
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.
