We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
The k-ary Montgomery modular inverse over nonbinary computers.
- Authors
Chen, Chien ‐ Yuan; Huang, Chien ‐ Feng; Lin, Yu ‐ Feng
- 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 − 12 n 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 − 1 k m mod P, where P, Q, and k are pairwise relatively prime positive integers and m = log k P. In the worst case, the computational cost of our algorithm is O( m2) k-ary digit operations. Copyright © 2013 John Wiley & Sons, Ltd.
- Subjects
MODULAR functions; INVERSE functions; ALGORITHMS; DIVISOR theory; INTEGERS; MATHEMATICAL analysis
- Publication
Mathematical Methods in the Applied Sciences, 2013, Vol 36, Issue 14, p1940
- ISSN
0170-4214
- Publication type
Article
- DOI
10.1002/mma.2738