Fast decipherment algorithm for RSA public-key cryptosystem
J.-J. Quisquater, Christophe Couvreur · Electronics Letters · 1982
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.