Truelly Random Numbers

[Gary Howland]

-----BEGIN PGP SIGNED MESSAGE-----

Timothy C May wrote:

> In some PK code I did several years ago in Mathematica, the primes for the
> RSA modulus were found by picking a "random" (more on this later) starting
> point and then counting up from there, testing for primality (actually,
> pseudoprimality, technically). As one would expect, primes are found fairly
> quickly.

Surely the process of counting up until you get a prime means
that the chances of getting certain primes are greater than
others (eg. 17 is more likely than 19) ?

Gary
- ---
[This message has been signed by an auto-signing service.  A valid signature
means only that it has been received at the address corresponding to the
signature and forwarded.]

-----BEGIN PGP SIGNATURE-----
Version: 2.6.2
Comment: Gratis auto-signing service

iQBFAwUBMTm2jCoZzwIn1bdtAQEIOwGAg9YkxQXKKS07ZVBvEfzTRaNcxMnZDUYa
sfyzl2mr7UZ94AEoVyWgcsYQXvuFG1QK
=fOGq
-----END PGP SIGNATURE-----