A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation

被引：31

作者：

Ha, JC

Moon, SJ ^{[1
]}

机构：

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

[2] Korea Nazarene Univ, Dept Comp & Informat, Chonan 330090, Choongnam, South Korea

来源：

INFORMATION PROCESSING LETTERS | 1998年 / 66卷 / 02期

关键词：

public key cryptosystem; fast exponentiation; modular arithmetic; common-multiplicand multiplication; cryptography;

D O I：

10.1016/S0020-0190(98)00031-3

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A common-multiplicand method to the Montgomery algorithm makes an improvement in speed when right-to-left binary exponentiation is applied. The idea is that the same common part in two modular multiplications can be computed once rather than twice. It reduces the overall number of single-precision multiplications by about 16%, compared to exponentiation with the Montgomery algorithm. (C) 1998 Elsevier Science B.V.

引用

页码：105 / 107

页数：3

共 50 条

[1] An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
Wu, Chia-Long
[J]. INFORMATION SCIENCES, 2009, 179 (04) : 410 - 421
[2] A comment on "An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation"
Sun, Da-Zhi
Huai, Jin-Peng
Cao, Zhen-Fu
[J]. INFORMATION SCIENCES, 2013, 223 : 331 - 334
[3] Fast, compact and symmetric modular exponentiation architecture by common-multiplicand Montgomery modular multiplications
Wu, Tao
Li, Shuguo
Liu, Litian
[J]. INTEGRATION-THE VLSI JOURNAL, 2013, 46 (04) : 323 - 332
[4] Fast batch modular exponentiation with common-multiplicand multiplication
Seo, Jungjoo
Park, Kunsoo
[J]. INFORMATION PROCESSING LETTERS, 2018, 129 : 5 - 10
[5] Improved common-multiplicand multiplication and fast exponentiation by exponent decomposition
Yen, SM
[J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1997, E80A (06) : 1160 - 1163
[6] Fast algorithms for common-multiplicand multiplication and exponentiation by performing complements
Chang, CC
Kuo, YT
Lin, CH
[J]. AINA 2003: 17TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS, 2003, : 807 - 811
[7] Inefficiency of common-multiplicand multiplication and exponentiation algorithms by performing binary complements
Yen, Sung-Ming
Lien, Wei-Chih
Moon, SangJae
[J]. APPLIED MATHEMATICS AND COMPUTATION, 2007, 189 (01) : 285 - 290
[8] IMPROVED GENERALIZATION COMMON-MULTIPLICAND MULTIPLICATIONS ALGORITHM OF YEN AND LAIH
WU, TC
CHANG, YS
[J]. ELECTRONICS LETTERS, 1995, 31 (20) : 1738 - 1739
[9] COMMON-MULTIPLICAND MULTIPLICATION AND ITS APPLICATIONS TO PUBLIC-KEY CRYPTOGRAPHY
YEN, SM
LAIH, CS
[J]. ELECTRONICS LETTERS, 1993, 29 (17) : 1583 - 1584
[10] A note on speeding up exponentiation by precomputation
Herendi, Tamas
[J]. PUBLICATIONES MATHEMATICAE-DEBRECEN, 2011, 79 (3-4): : 469 - 478

← 1 2 3 4 5 →