articleTop 10% cited
Fast decipherment algorithm for RSA public-key cryptosystem
Electronics Letters · 1982 · Vol. 18(21) · pp. 905–907
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.
Coding theory and cryptographyChaos-based Image/Signal EncryptionCryptography and Residue ArithmeticCryptosystemDeciphermentModular arithmeticChinese remainder theoremPublic-key cryptographyKey (lock)Modular exponentiationModular designComputer scienceArithmetic
Citations
385
FWCI
2.95
field-weighted impact
References
9
Percentile
91%
vs. same field & year
Citations per year
References
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM · 1983 · 13,110 citations
Related articles
Fast decipherment algorithm for RSA public-key cryptosystem
Electronics Letters · 1982 · 385 citations
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.