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)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

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.

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.

References

    1. 1)
      • New directions in cryptography
    2. 2)
      • A method of obtaining digital signatures and public-key cryptosystems
    3. 3)
      • Strong RSA keys
    4. 4)
      • , The art of computer programming, vol. II. Semi-numerical algorithms
    5. 5)
      • Probabilistic algorithm for testing primality
    6. 6)
      • On distinguishing prime numbers from composite numbers
    7. 7)
      • , Primality testing and Jacobi sums
    8. 8)
      • 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
This is a required field
Please enter a valid email address