🚀 go-pugleaf

In article <1992Aug2.145532.4657@linus.mitre.org> bs@faron.mitre.org (Robert D. Silverman) writes:

! Select an inteval(s) near the size you want, e.g. 10^100. (and say 10^102)
! Sieve out composites divisible by small primes.
! Select two strong probable primes p & q such that p-q is reasonably
! large (at least 10^25). [This defeats difference of squares methods].
! ECM makes restrictions on p-1 and q-1 useless.

A recipe for RSA-keys:
	- Take the 10-sided dice from a Dungeons&Dragons package.
	- Throw it 100 times to get p1, then 102 times to get q1.
	(Now you have truly random numbers, not pseudo-random.)
	- Tell Mathematica version 2 the following:
		p = p1
		q = q1
		While[!PrimeQ[p], p++]
		While[!PrimeQ[q], q++]

It will only take a minute or two depending on your computer. For 
added security you could use numbers around 150 digits. Even that wouldn't
take very long (tested). Sounds a good way to pass time. Perhaps I'll do it the
next time I get bored.
--
...............................................................................
Ari Huttunen                                         You don't miss water
                                                       until the well runs dry.