In 1991 Marsaglia and Zaman's publication of "A new class of random number generators" received considerable attention. After a brief introduction to this class of RNGs we will see how the ideas involved lead to some observations concerning algorithms for the decimal (and other base) representation of fractions. This, in turn, will lead us to a new theorem in number theory and to a possible attack on the security of RSA encryption.

About the Speaker: David Hayes earned a Master's in Mathematics at CSU East Bay and his Ph.D. at U. C. Davis. His thesis was in graph theory and computational complexity. His current interests are in the areas of Computer Architecture, Networks, and Number Theory. He is currently the Chair of the Department of Mathematics and Computer Science at San Jose State.