Parallel implementation of the rsa public-key cryptosystem

Abstract

In just over ten years, public-key crytography has gone from a novel concept to a mainstay of cryptographic technology. Most public-key cryptosystems are constructed based on a modular exponentiation and each modular exponentiation, in turn, is made up of modular multiplications. One challenge is how to reduce the running time of a modular exponentiation. A fast exponentiation method using parallel processing is presented. This method can be employed with other existing methods for further speedup. The popular RSA cryptosystem is used as an example to demonstrate this study.

Keywords:

• Cryptography
• public-key cryptosystem
• modular multiplication
• modular exponentiation
• information security

C.R. CATEGORIES::

• E.3.