DocumentCode
992679
Title
Strong RSA keys
Author
Gordon, Josh
Author_Institution
Cybermation Limited, Wheathampstead, UK
Volume
20
Issue
12
fYear
1984
Firstpage
514
Lastpage
516
Abstract
A simple method is given for finding strong primes for use in conjunction with the RSA Public Key Cryptosystem. A strong prime p is a large prime satisfying the following: (a) p = 1 mod r; (b) p = s¿1 mod s; (c) r = 1 mod t; where r, s and t are all large, random primes. It is shown that the problem of finding strong, random, large primes is only 19% harder than finding random, large primes.
Keywords
codes; cryptography; RSA keys; codes; public key cryptosystem; strong primes;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:19840357
Filename
4248822
Link To Document