Title :
Modular multiplication method
Author :
Oh, J.-H. ; Moon, S.-J.
Author_Institution :
Sch. of Electron. & Electr. Eng., Kyungpook Nat. Univ., Taegu, South Korea
fDate :
7/1/1998 12:00:00 AM
Abstract :
The Montgomery algorithm has been widely used in modern cryptography because it is effective for modular exponentiation. However, it is not efficient when used for just a few modular multiplications. Inefficiency is due to the large overhead involved in the residue transformation of arguments. A new modular multiplication method using the Montgomery reduction algorithm is presented which can eliminate the demerit of the Montgomery algorithm in the case of just a few modular multiplications
Keywords :
cryptography; Montgomery algorithm; cryptography; modular exponentiation; modular multiplication method; modular multiplications; residue transformation;
Journal_Title :
Computers and Digital Techniques, IEE Proceedings -
DOI :
10.1049/ip-cdt:19982095
