Computational efficiency analysis of Wu et al.'s fast modular multi-exponentiation algorithm

  title={Computational efficiency analysis of Wu et al.'s fast modular multi-exponentiation algorithm},
  author={Da-Zhi Sun and Jin-Peng Huai and J. Sun and Jiawan Zhang},
  journal={Appl. Math. Comput.},
  • Da-Zhi Sun, Jin-Peng Huai, +1 author Jiawan Zhang
  • Published 2007
  • Mathematics, Computer Science
  • Appl. Math. Comput.
  • Very recently, for speeding up the computation of modular multi-exponentiation, Wu et al. presented a fast algorithm combining the complement recoding method and the minimal weight binary signed-digit representation technique. They claimed that the proposed algorithm reduced the number of modular multiplications from 1.503k to 1.306k on average, where the value k is the maximum bit-length of two exponents. However, in this paper, we show that their claim is unwarranted. We analyze the… CONTINUE READING
    5 Citations

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    A Fast Modular Multiexponentiation Algorithm Revisited
    • H. Jin, D. Wong, Yinlong Xu
    • Mathematics
    • 2009 International Conference on Computational Intelligence and Software Engineering
    • 2009
    • 1
    Analysis of complements in Multi-Exponentiation Algorithms Using Signed Digit Representations
    • 2


    Fast modular multi-exponentiation using modified complex arithmetic
    • 15
    Fast algorithms for common-multiplicand multiplication and exponentiation by performing complements
    • 32
    Complexity and Fast Algorithms for Multiexponentiations
    • 54
    • PDF
    Low-Weight Binary Representations for Pairs of Integers
    • 141
    • PDF
    Complex number multipliers
    • 22
    Handbook of Applied Cryptography
    • 11,139
    • PDF
    Pekmestzi , Complex number multipliers
    • IEE Proceeding - Computers and Digital Techniques
    • 1989