DocumentCode :
981200
Title :
Fast decipherment algorithm for RSA public-key cryptosystem
Author :
Quisquater, J.-J. ; Couvreur, C.
Author_Institution :
Philips Research Laboratory, Brussels, Belgium
Volume :
18
Issue :
21
fYear :
1982
Firstpage :
905
Lastpage :
907
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.
Keywords :
codes; cryptography; Chinese remainder theorem; RSA public-key cryptosystem; cryptograms; fast decipherment algorithm; modular multiplication algorithms;
fLanguage :
English
Journal_Title :
Electronics Letters
Publisher :
iet
ISSN :
0013-5194
Type :
jour
DOI :
10.1049/el:19820617
Filename :
4246955
Link To Document :
بازگشت