کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
393914 665710 2013 4 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A comment on “An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation”
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
A comment on “An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation”
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Sciences - Volume 223, 20 February 2013, Pages 331–334
نویسندگان
, , ,