Modular multiplication method

被引：5

作者：

Oh, JH ^{[1
]}

Moon, SJ ^{[1
]}

机构：

[1] Kyungpook Natl Univ, Sch Elect & Elect Engn, Taegu 702701, South Korea

来源：

IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES | 1998年 / 145卷 / 04期

关键词：

Cryptography; Digital signature; Modular multiplication; Montgomery algorithm;

D O I：

10.1049/ip-cdt:19982095

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：317 / 318

页数：2