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

@article{Sun2007ComputationalEA,
  title={Computational efficiency analysis of Wu et al.'s fast modular multi-exponentiation algorithm},
  author={Da-Zhi Sun and Jin-Peng Huai and Jizhou Sun and Jiawan Zhang},
  journal={Applied Mathematics and Computation},
  year={2007},
  volume={190},
  pages={1848-1854}
}
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

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
Showing 1-6 of 6 references

P

A. Menezes
van Oorschot, S. Vanstone, Handbook of Applied Cryptography, CRC Press, Boca Raton • 1997
View 2 Excerpts

Complex number multipliers

K. Pekmestzi
IEE Proceeding-Computers and Digital Techniques 136 (1) • 1989

Pekmestzi , Complex number multipliers

G. A. Jullien, W. C. Miller
IEE Proceeding - Computers and Digital Techniques • 1989

Similar Papers

Loading similar papers…