Efficient Hardware for Modular Exponentiation Using the Sliding-Window Method

Modular exponentiation is an essential operation for various applications, such as cryptography. The performance of this operation has a tremendous impact on the efficiency of the whole application. Therefore, many researchers devoted special interest to providing smart methods and efficient implementation for modular exponentiation. One this method is the sliding-window method, which pre-processes the exponent into zero and non-zero partitions so that the number of modular multiplications required computing the modular power is reduced. In this paper, we devise a novel hardware for computing modular exponentiation using the sliding-window method. The implementation is efficient when compared against existing hardware implementations of the modular exponentiation

[1]  N. Nedjah,et al.  Two hardware implementations for the Montgomery modular multiplication: sequential versus parallel , 2002, Proceedings. 15th Symposium on Integrated Circuits and Systems Design.

[2]  Noboru Kunihiro,et al.  New Methods for Generating Short Addition Chains , 2000 .

[3]  P. L. Montgomery Modular multiplication without trial division , 1985 .

[4]  Nadia Nedjah,et al.  Four Hardware Implementations for the M-ary Modular Exponentiation , 2006, Third International Conference on Information Technology: New Generations (ITNG'06).

[5]  J. L. Selfridge,et al.  Fermat numbers and Mersenne numbers , 1964 .