Check out: "Quasi-Random Number Sequences from a Long-Period TLP Generator with Remarks on Application to Cryptography" by Herbert S. Bright and Richard L. Enison, Computing Surveys, Vol. II, No. 4, December 1979 It describes a random number generator based on select Mersenne primes. The sequence can be used as a cryptographic pad and is secure provided you know a Mersenne prime bigger than the next guy. I don't know enough math to even know if this desciption is accurate. Perhaps we could get a comment from an expert. -brad
