DocumentCode
1165537
Title
Proportion of primes generated by strong prime methods
Author
Shawe-Taylor, John
Author_Institution
Dept. of Comput. Sci., R. Holloway & Bedford New Coll., Egham, UK
Volume
28
Issue
2
fYear
1992
Firstpage
135
Lastpage
136
Abstract
The numbers of primes generated by two prime generation methods are evaluated. The methods considered generate strong primes for cryptographic use in the RSA public-key cryptosystem. The results show that they generate sufficient primes to resist cryptanalytic attack by prime enumeration for the sizes of primes used to guard against factorisation attack.
Keywords
cryptography; information theory; RSA; cryptanalytic attack; factorisation attack; prime enumeration; prime generation methods; public-key cryptosystem; strong prime methods;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:19920084
Filename
118928
Link To Document