Parallel implementation of the rsa public-key cryptosystem
Author:
- 1 January 1993
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 48 (3-4) , 153-155
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
This publication has 2 references indexed in Scilit:
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976