Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Generating strong primes

Generating strong primes

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Electrical Engineers
Published

A new method of generating strong primes is presented. The method produces primes satisfying Gordon's strong prime requirements but which are not probabilistic. The expected time required to generate such a prime is comparable with previously proposed methods.

Inspec keywords: cryptography

Other keywords: strong primes; expected time; Gordon's strong prime requirements; cryptography

Subjects: Data handling techniques; Codes

References

    1. 1)
      • W. Diffie , M.E. Hellman . New directions in cryptography. IEEE Trans. , 644 - 654
    2. 2)
      • H. Cohen , H.W. Lenstra . (1984) , Primality testing and Jacobi sums.
    3. 3)
      • M.O. Rabin . Probabilistic algorithm for testing primality. J. Number Theory , 128 - 138
    4. 4)
      • R.L. Rivest , A. Shamir , L. Adleman . A method of obtaining digital signatures and public-key cryptosystems. Commun. ACM , 120 - 126
    5. 5)
      • D.E. Knuth . (1981) , The art of computer programming, vol. II. Semi-numerical algorithms.
    6. 6)
      • L.M. Adleman , C. Pomerance , S. Rumely . On distinguishing prime numbers from composite numbers. Ann. Math. , 173 - 206
    7. 7)
      • J. Gordon . Strong RSA keys. Electron. Lett. , 514 - 516
    8. 8)
      • H.W. Lenstra , H.W. Lenstra , R. Tijdeman . Primality testing, Math. Zentrum Tracts no. 154.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19860598
Loading

Related content

content/journals/10.1049/el_19860598
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address