A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
VHDL: Analysis and Modeling of Digital Systems
VHDL: Analysis and Modeling of Digital Systems
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Two Hardware Implementations for the Montgomery Modular Multiplication: Sequential versus Parallel
Proceedings of the 15th symposium on Integrated circuits and systems design
Four Hardware Implementations for the M-ary Modular Exponentiation
ITNG '06 Proceedings of the Third International Conference on Information Technology: New Generations
International Journal of Parallel Programming - Special issue on the 19th international symposium on computer architecture and high performance computing (SBAC-PAD 2007)
Hi-index | 0.00 |
Modular exponentiation is an essential operations for various applications, such as cryptography. The performance of this operations 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 these methods is the sliding-window method, which preprocesses the exponent into zero and non-zero partitions so that the number of modular multiplications required to compute the modular power is reduced. In this paper, we devise a novel harwdare for computing modular exponentiation using the sliding-window method. The implementation is efficient when compared against existing hardware implementations of the modular exponentiation.