Results 1 
4 of
4
Fast Generation Of Random, Strong RSA Primes
, 1997
"... A number of cryptographic standards currently under development call for the use of strong primes in the generation of an RSA key. This paper suggests a fast way of generating random strong primes that also satisfy a number of other cryptographic requirements. The method requires no more time to ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
A number of cryptographic standards currently under development call for the use of strong primes in the generation of an RSA key. This paper suggests a fast way of generating random strong primes that also satisfy a number of other cryptographic requirements. The method requires no more time to generate strong primes than it takes to generate random primes.
Finding prime pairs with particular gaps
 Math. Comp
, 2002
"... Abstract. By a prime gap of size g, we mean that there are primes p and p + g such that the g − 1 numbers between p and p + g are all composite. It is widely believed that infinitely many prime gaps of size g exist for all even integers g. However, it had not previously been known whether a prime ga ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
(Show Context)
Abstract. By a prime gap of size g, we mean that there are primes p and p + g such that the g − 1 numbers between p and p + g are all composite. It is widely believed that infinitely many prime gaps of size g exist for all even integers g. However, it had not previously been known whether a prime gap of size 1000 existed. The objective of this article was to be the first to find a prime gap of size 1000, by using a systematic method that would also apply to finding prime gaps of any size. By this method, we find prime gaps for all even integers from 746 to 1000, and some beyond. What we find are not necessarily the first occurrences of these gaps, but, being examples, they give an upper bound on the first such occurrences. The prime gaps of size 1000 listed in this article were first announced on the Number Theory Listing to the World Wide Web on Tuesday, April 8, 1997. Since then, others, including Sol Weintraub and A.O.L. Atkin, have found prime gaps of size 1000 with smaller integers, using more ad hoc methods. At the end of the article, related computations to find prime triples of the form 6m +1, 12m − 1, 12m + 1 and their application