Cryptography, too, relies heavily on random numbers for the generation of unbreakable keys. Better, cheaper ways of generating and handling such numbers are therefore always welcome.

The author presents a generalization he worked out in 1950 of von Neumann's method of generating random samples from the exponential distribution by comparisons of uniform random numbers on $(0, 1)$.