DocumentCode :
1554339
Title :
Efficient method for generating strong primes with constraint of bit length
Author :
Laih, C.-S. ; Yang, Wen-Cheng ; Chen, Chun-Hung
Author_Institution :
Dept. of Electr. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan
Volume :
27
Issue :
20
fYear :
1991
Firstpage :
1807
Lastpage :
1808
Abstract :
Many methods have been proposed to generate the strong primes for the RSA public key cryptosystem. However, all of the methods are inefficient if strong primes with the constraint of bit length need to be generated. An efficient method is proposed for generating strong primes with the constraint of bit length.
Keywords :
cryptography; information theory; RSA public key cryptosystem; constraint of bit length; strong primes generation;
fLanguage :
English
Journal_Title :
Electronics Letters
Publisher :
iet
ISSN :
0013-5194
Type :
jour
DOI :
10.1049/el:19911123
Filename :
97189
Link To Document :
بازگشت