🚀 go-pugleaf

Ari.Huttunen@hut.fi (Ari Juhani Huttunen) writes:

>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++]

Hi!

True, you'll get truly random numbers 'p' and 'q' to start with, but the
resulting '++':ed prime numbers are not randomly distributed among primes,
because they'll have much harder time hitting the greater of any pair of
twin primes, than the smaller - for an example.  This may have some bad
effects in the generation of RSA keys, since some primes being preceded
by longer-than-average run of composite numbers are sometimes of special
arithmetic form ( P = factorial(x)+1 comes to mind).  Also, knowing the
uneven distribution of seeds might help an offender to break the cipher
more easily.

terveisin: Risto Lankinen
-- 
Risto Lankinen / risto@tuura.icl.fi ***************************************
Software designer, Systems Division *  1                              2   *
ICL Personal Systems, Helsinki, FIN * 2 +1 is PRIME!  Now working on 2 +1 *
"Aren't buglets fun?" Anon.OS/2-fan ***************************************