An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation

@article{Wu2009AnEC,
  title={An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation},
  author={Chia-Long Wu},
  journal={Inf. Sci.},
  year={2009},
  volume={179},
  pages={410-421}
}
The modular exponentiation is a common operation for scrambling secret data and is used by several public-key cryptosystems, such as the RSA scheme and DSS digital signature scheme. However, the calculations involved in modular exponentiation are time-consuming especially when performed in software. In this paper, we propose an efficient CMM-MSD Montgomery algorithm by utilizing the Montgomery modular reduction method, common-multiplicand-multiplication (CMM) method, and minimal-signed-digit… CONTINUE READING

Tables, Results, and Topics from this paper.

Key Quantitative Results

  • Moreover, by using the proposed CMM-MSD Montgomery algorithm, on average the total number of single-precision multiplications can be reduced by about 38.9% and 26.68% as compared with Dusse-Kaliski's Montgomery algorithm and Ha-Moon's Montgomery algorithm, respectively.

References

Publications referenced by this paper.
SHOWING 1-10 OF 29 REFERENCES

The Art of Computer Programming

D. E. Knuth
  • Seminumerical Algorithms, vol. II, Addison-Wesley, MA
  • 1997
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Signed Digit Representations of Minimal Hamming Weight

  • IEEE Trans. Computers
  • 1993
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

A survey of fast exponentiation methods

D. M. Gordon
  • Journal of Algorithms 27 (1) (1998) 129–146. C.-L. Wu / Information Sciences 179
  • 2009
VIEW 2 EXCERPTS