摘要
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.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 331-334 |
| 页数 | 4 |
| 期刊 | Information Sciences |
| 卷 | 223 |
| DOI | |
| 出版状态 | 已出版 - 20 2月 2013 |
| 已对外发布 | 是 |
学术指纹
探究 'A comment on "an efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation"' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver