Title: Parallel computation of modular exponentiation for fast cryptography

Authors: Nadia Nedjah, Luiza de Macedo Mourelle

Addresses: Faculty of Engineering, State University of Rio de Janeiro, Rio de Janeiro, Brazil. ' Faculty of Engineering, State University of Rio de Janeiro, Rio de Janeiro, Brazil

Abstract: 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.

Keywords: modular exponentiation; modular multiplication; public key cryptography; parallel computing; RSA encryption.

DOI: 10.1504/IJHPSA.2007.013290

International Journal of High Performance Systems Architecture, 2007 Vol.1 No.1, pp.44 - 49

Published online: 19 Apr 2007 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article