Abstract
This paper, describes novel algorithms and circuitry for binary modulo-multiplication and combined multiplication-division. Unlike the commonly used Montgomery modular multiplier, no domain mapping is needed for the input operands or the output result. Further, the new algorithms work for both even and odd moduli. The combined multiplication-division algorithm produces the quotient as well as the remainder thus allowing the implementation of simple multiplier-dividers. The proposed algorithm uses left shift-based multiplication while maintaining the size of the intermediate running product contained by interleaving reduction and multiplication operations. Reduction is determined by examining only the two most significant bits of the running product if Carry-Propagate adders are used or the 3 most significant bits if Carry-Save Adders are used. Hardware implementations of the proposed algorithms show area and delay figures comparable to those of Montgomery.
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.
