Fast decipherment algorithm for RSA public-key cryptosystem

1982/10/14 by J.-J. Quisquater, C. Couvreur, Christophe Couvreur · 2 citations
Computer Science · #Coding theory and cryptography #Chaos-based Image/Signal Encryption #Cryptography and Residue Arithmetic

paper · doi:10.1049/el:19820617

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.

Cited by

• CDSP: A Solution for Privacy and Security of Multimedia Information Processing in Industrial Big Data and Internet of Things. [europepmc]
• Possibility of decryption speed-up by parallel processing in CCA secure hashed ElGamal. [europepmc]

Related

• A Study and Implementation of RSA Cryptosystem
• Analysis of RSA algorithm using GPU programming
• A multifactor RSA-like scheme with fast decryption based on Rédei rational functions over the Pell hyperbola
• Two RSA-based Cryptosystems
• DM-RSA: An Extension of RSA with Dual Modulus