Fast decipherment algorithm for RSA public-key cryptosystem

1982385 citationsJournal Article

Authors

J.-J. Quisquater · IPS Research (United States)

Christophe Couvreur · IPS Research (United States)

Abstract

A fast algorithm is presented for deciphering cryptograms involved in the public-key cryptosystem proposed by Rivest, Shamir and Adleman. The deciphering method is based on the Chinese remainder theorem and on improved modular multiplication algorithms.

Topics & Keywords

Coding theory and cryptography Chaos-based Image/Signal Encryption Cryptography and Residue Arithmetic

Publication Details

Published in: Electronics Letters

Volume 18, Issue 21, pp. 905-907

DOI: 10.1049/el:19820617

Field-Weighted Citation Impact: 2.81

Command Palette

Fast decipherment algorithm for RSA public-key cryptosystem

Authors

Abstract

Topics & Keywords

Publication Details