Abstract

This paper proposes a new algorithm of calculating modular multiplicative inverse numbers based on residue signed-digit(SD) number arithmetic. By introducing a p-digit radix-two SD number system into the residue arithmetic, a modular addition is implemented by using two SD adders for a modulus m, where 2p − 1 ≤ m ≤ 2p+1 − 1, and no carry propagations will arise during the additions. We give a new architecture with the residue SD adder to realize a faster modular multiplicative inverse computation. The design result shows that the proposed circuits using the SD arithmetic are faster than that based on the binary ones.

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

Disclaimer: 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.