Title :
Iterative modular multiplication algorithm without magnitude comparison
Author :
Chiou, Che Wun ; Yang, T.C.
Author_Institution :
Chung Shan Inst. of Sci. & Technol., Lung-Tan
fDate :
11/24/1994 12:00:00 AM
Abstract :
A fast iterative modular multiplication algorithm is proposed for modular exponentiation with a large modulus, such as the RSA cryptosystem. The limit on partial products is raised to become less than 2n instead of modulus N with n-bit length. The naturally generated carry signifies when the computed partial product is greater than or equal to 2n, and a subtraction is subsequently performed. No magnitude comparisons are required
Keywords :
cryptography; iterative methods; number theory; RSA cryptosystem; cryptography; iterative modular multiplication algorithm; modular exponentiation; naturally generated carry; number-theoretic systems; partial products;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19941383
