Advertisement

Cryptographic pseudo-random numbers in simulation

  • Nick Maclaren
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 809)

Abstract

A fruitful source of confusion on the Internet is that both cryptologists and statisticians use pseudo-random numbers, but their objectives and constraints are subtly different. This paper will describe some of the requirements for a good generator for statistical simulations, and attempt to put them into cryptological terms.

It is important to note that there is no consensus on when a pseudo-random number generator can be regarded as adequate, both because the theory is very incomplete and because so many different fields are involved. Every journal that includes work on either cryptology or statistical methods is likely to include important papers, and no worker in the field is familiar with the whole literature. Broad agreement on criteria is the best that can be expected.

Keywords

Random Number Generator Differential Cryptanalysis Fruitful Source Random Uniformity Spectral Test 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [1]
    De Matteis, A. and Pagnutti, A., “Parallelization of random number generators and long-range correlations”, in Numerische Mathematik, 53 (1988) pp 595–608.Google Scholar
  2. [2]
    Hammersley, J.M. and Handscomb, D.C., 'Monte-Carlo Methods', Methuen, 1967.Google Scholar
  3. [3]
    Knuth, D.E., 'The Art of Computer Programming', Vol. 2 / Seminumerical Algorithms second edition, Addison-Wesley 1981.Google Scholar
  4. [4]
    Maclaren, N.M., “The generation of multiple independent sequences of pseudorandom numbers”, in Applied Statistics, 38 (1989) pp 351–359.Google Scholar
  5. [5]
    Maclaren, N.M., “A limit on the usable length of a pseudorandom sequence”, in J. Statist. Comput. Simul. 42, (1992) pp 47–54.Google Scholar
  6. [6]
    Marsaglia, G., “A current view of random number generators”, in Computer Science and Statistics, Elsevier (1985).Google Scholar
  7. [7]
    Maurer, U.M., “A Universal Statistical Test for Random Bit Generators”, in Advances in Cryptology — CRYPTO '90, Springer-Verlag Lecture Notes in Computer Science 537 pp 409–420Google Scholar
  8. [8]
    Micali, S. and Schnorr, C.P., “Efficient, Perfect Polynomial Random Number Generators”, in Journal of Cryptology, 3 (1991) pp 157–172.Google Scholar
  9. [9]
    Stuart, A. and Ord, J,K., 'Kendall's Advanced Theory of Statistics', Vol. 1, Griffin, 5th Edition 1987.Google Scholar
  10. [10]
    Young, E.A., DES code on Internet, from University of Queensland, Australia.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Nick Maclaren
    • 1
  1. 1.University of Cambridge Computer LaboratoryCambridge

Personalised recommendations