Cryptology ePrint Archive: Report 2008/210

Complexity Analysis of a Fast Modular Multiexponentiation Algorithm

Haimin Jin and Duncan S. Wong and Yinlong Xu

Abstract: Recently, a fast modular multiexponentiation algorithm for computing A^X B^Y (mod N) was proposed. The authors claimed that on average their algorithm only requires to perform 1.306k modular multiplications (MMs), where k is the bit length of the exponents. This claimed performance is significantly better than all other comparable algorithms, where the best known result by other algorithms achieves 1.503k MMs only. In this paper, we give a formal complexity analysis and show the claimed performance is not true. The actual computational complexity of the algorithm should be 1.556k. This means that the best modular multiexponentiation algorithm based on canonical-sighed-digit technique is still not able to overcome the 1.5k barrier.

Category / Keywords: public-key cryptography / Modular Multi-Exponentiation

Date: received 12 May 2008

Contact author: duncan at cityu edu hk

Available format(s): PDF | BibTeX Citation

Version: 20080521:043644 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]