Parallel computation of modular exponentiation for fast cryptography
Nadia Nedjah, Luiza de Macedo Mourelle · International Journal of High Performance Systems Architecture · 2007
Modular exponentiation is fundamental to several public-key cryptography systems such as the RSA encryption system, as well as the most dominant part of the computation performed. The operation is time consuming for large operands. This paper analyses and compares the complexity of a variety of algorithms proposed to compute the modular exponentiation of a relatively large binary number and proposes a new parallel modular exponentiation method.