Parallel computation of modular exponentiation for fast cryptography. (20th April 2007)

• Record Type: Journal Article
• Authors: Nedjah, Nadia; Mourelle, Luiza de Macedo
• Is Part Of: International journal of high performance systems architecture. Volume 1:Number 1(2007)
• Page Start: 44
• Page End: 49
• Publication Date: 2007-04-20
• Subjects: modular exponentiation -- modular multiplication -- public key cryptography -- parallel computing -- RSA encryption; Computer architecture -- Periodicals; Computer systems -- Periodicals; High performance computing -- Periodicals; 004.205
• Languages: English
• ISSNs: 1751-6528

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.