A comment on "An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation"

被引：1

作者：

Sun, Da-Zhi ^{[1
,2
]}

Huai, Jin-Peng ^{[2
]}

Cao, Zhen-Fu ^{[3
]}

机构：

[1] Tianjin Univ, Sch Comp Sci & Technol, Tianjin 300072, Peoples R China

[2] Beihang Univ, Sch Comp Sci, Beijing 100083, Peoples R China

[3] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai 200240, Peoples R China

来源：

INFORMATION SCIENCES | 2013年 / 223卷

基金：

中国博士后科学基金; 中国国家自然科学基金;

关键词：

Modular arithmetic; Modular exponentiation; Single-precision multiplication; Computational efficiency; Public-key cryptography;

D O I：

10.1016/j.ins.2012.09.052

中图分类号：

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

学科分类号：

0812 ;

摘要：

In 2009, Wu proposed a fast modular exponentiation algorithm and claimed that the proposed algorithm on average saved about 38.9% and 26.68% of single-precision multiplications as compared to Dusse-Kaliski's Montgomery algorithm and Ha-Moon's Montgomery algorithm, respectively. However, in this comment, we demonstrate that Wu's algorithm on average reduces the number of single-precision multiplications by at most 22.43% and 6.91%, when respectively compared with Dusse-Kaliski's version and Ha-Moon's version. That is, the computational efficiency of Wu's algorithm is obviously overestimated. (C) 2012 Elsevier Inc. All rights reserved.

引用

页码：331 / 334

页数：4

共 46 条

[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 common-multiplicand method to the Montgomery algorithm for speeding up exponentiation
Ha, JC
Moon, SJ
[J]. INFORMATION PROCESSING LETTERS, 1998, 66 (02) : 105 - 107
[3] Parallel exponentiation using common-multiplicand-multiplication and signed-digit-folding techniques
Lou, DC
Wu, CL
[J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2004, 81 (10) : 1187 - 1202
[4] Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques
Wu, Chia-Long
[J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2007, 84 (10) : 1405 - 1415
[5] Fast batch modular exponentiation with common-multiplicand multiplication
Seo, Jungjoo
Park, Kunsoo
[J]. INFORMATION PROCESSING LETTERS, 2018, 129 : 5 - 10
[6] 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
[7] 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
[8] 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
[9] 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
[10] An efficient montgomery exponentiation algorithm for cryptographic applications
Wu, CL
Lou, DC
Chang, TJ
[J]. INFORMATICA, 2005, 16 (03) : 449 - 468

← 1 2 3 4 5 →