TY - JOUR
T1 - A comment on "an efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation"
AU - Sun, Da Zhi
AU - Huai, Jin Peng
AU - Cao, Zhen Fu
PY - 2013/2/20
Y1 - 2013/2/20
N2 - 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 Dussé-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 Dussé-Kaliski's version and Ha-Moon's version. That is, the computational efficiency of Wu's algorithm is obviously overestimated.
AB - 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 Dussé-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 Dussé-Kaliski's version and Ha-Moon's version. That is, the computational efficiency of Wu's algorithm is obviously overestimated.
KW - Computational efficiency
KW - Modular arithmetic
KW - Modular exponentiation
KW - Public-key cryptography
KW - Single-precision multiplication
UR - https://www.scopus.com/pages/publications/84870255053
U2 - 10.1016/j.ins.2012.09.052
DO - 10.1016/j.ins.2012.09.052
M3 - 文章
AN - SCOPUS:84870255053
SN - 0020-0255
VL - 223
SP - 331
EP - 334
JO - Information Sciences
JF - Information Sciences
ER -