Re: generating weak primes

Ge' Weijers (ge@Progressive-Systems.Com)
Tue, 17 Mar 1998 16:40:21 -0500 (EST)

• Next message: Hal Finney: "Re: generating weak primes"
• Previous message: Robert Hettinga: "An Apology (was Re: Call for Founders: Digital Bearer Settlement Email List and)"
• In reply to: Linn H. Stanton: "Re: Call for Founders: Digital Bearer Settlement Email List and"
• Next in thread: Hal Finney: "Re: generating weak primes"

A prime is weak if p-1 does not have any large factors. So: come up with a
bunch of smallish primes r[1]...r[n]. Calculate

p = r[1] * r[2] * .... * r[n] * 2 + 1, and test whether p is prime. If
not, repeat :-)

Ge'

On Wed, 18 Mar 1998, Hamdi Tounsi wrote:

> sorry if my question seems strange ! i just wanna generate WEAK large
> primes !! this implies : what are special forms easily factored, and by
> which algorithms ?
>
> thanks in advance
>

Ge' Weijers Voice: (614)326 4600
Progressive Systems, Inc. FAX: (614)326 4601
2000 West Henderson Rd. Suite 400
Columbus, OH 43220 http://www.Progressive-Systems.com

• Next message: Hal Finney: "Re: generating weak primes"
• Previous message: Robert Hettinga: "An Apology (was Re: Call for Founders: Digital Bearer Settlement Email List and)"
• In reply to: Linn H. Stanton: "Re: Call for Founders: Digital Bearer Settlement Email List and"
• Next in thread: Hal Finney: "Re: generating weak primes"