Abstract
This paper presents a k-ary Montgomery modular inverse algorithm over nonbinary computers by using Sedjelmaci's right shift k-ary greatest common divisor scheme. Over traditional binary computers, Kaliski's scheme can output Montgomery modular inverse Q − 12n mod P, where P is coprime to Q and n is the bit length of P. Over k-ary computers, our algorithm can discover the k-ary Montgomery inverse Q − 1km mod P, where P, Q, and k are pairwise relatively prime positive integers and m = log kP. In the worst case, the computational cost of our algorithm is O(m2)k-ary digit operations. Copyright © 2013 John Wiley & Sons, Ltd.
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.
