A New Modified CMM Modular Exponentiation Algorithm

@inproceedings{Rezai2011ANM,
  title={A New Modified CMM Modular Exponentiation Algorithm},
  author={Abdalhossein Rezai and Parviz Keshavarzi},
  year={2011}
}
Modular exponentiation is fundamental operation in the many cryptosystem such as RSA. This operation is implemented by repeating modular multiplication which is time consuming for large operands. This paper presents a new modified Montgomery modular multiplication algorithm based on multiple bit scan-multiple bit shift technique, sliding window method and signed-digit representation. This new algorithm skips over zero digit multiplication and the following required addition. Then it shifts the… CONTINUE READING

References

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

An efficient Montgomery exponentiation algorithm for public-key cryptosystems

  • 2008 IEEE International Conference on Intelligence and Security Informatics
  • 2008
VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

Minimal weight digit set conversions

B.Philips, N.Burgess
  • IEEE Trans. on computers, vol. 53, no.6 pp. 666-677, 2004.
  • 2004
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Improvement of highspeed modular exponentiation algorithm by optimum using smart methods,

A. Rezai, P. Keshavarzi
  • Proceedings of 18th Iranian Conference on Electrical Engineering, Iran,
  • 2010
VIEW 2 EXCERPTS

Speed Improvement in elliptic curve cryptosystem scalar multiplication algorithm

A. Rezai, P. Keshavarzi
  • proceedings of 7th International ISC Conference on Information Security and Cryptology2010, Iran, pp.181-188, September 2010.
  • 2010
VIEW 2 EXCERPTS

Hihgh-performance hardware of the sliding-window method for parallel computation of modular exponentitions

N. Nedjah, L. M. Mouller
  • international journal of parallel programming, Springer Netherlands, vol.37, pp.537-555, 2009.
  • 2009
VIEW 3 EXCERPTS