skip to main content
10.1145/224401.224623acmconferencesArticle/Chapter ViewAbstractPublication PageswscConference Proceedingsconference-collections
Article
Free Access

Combination of multiplicative congruential random-number generators with safe prime modulus

Authors Info & Claims
Published:01 December 1995Publication History

ABSTRACT

Two or more multiplicative congruential random-number generators with prime modulus combined by means of a method proposed by Wichmann and Hill (1982) yield a random-number generator equivalent to a multiplicative congruential random-number generator with modulus equal to the product of the moduli of the component multiplicative congruential generators. The period of a random-number sequence obtained by the Wichmann-Hill method is equal to the least common multiple of the periods of the combined sequences. One of the two purposes of this paper is to present a necessary and sufficient set of efficiently verifiable conditions for the period to be equal to its maximum, which is the maximum of the least common multiple. Each of the conditions is always satisfied or is more easily verifiable when the modulus of each of the component generators is a safe prime. The other purpose of this paper is to derive an efficiently evaluatable formula for serial correlations of the maximum-period sequences by the Wichmann-Hill method. The authors recommend (i) to make the modulus of each of the component generators a safe prime, and (ii) to chose the multipliers of the components so as to (a) maximize the period and (b) make the serial correlations small in absolute value.

References

  1. Bratley, P., B. L. Fox, and L. E. Schrage. 1987. A guide to simulation. 2d ed. New York: Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Conway, J. H., and N. J. A. Sloane. 1988. Sphere packings, lattices and groups. New York: Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Coveyou, R. R., and R. D. MacPherson. 1967. Fourier analysis of uniform random number generators. Journal of the Association for Computing Machinery 14:100-119. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Dieter, U., and J. Ahrens. 1971. An exact determination of serial correlations of pseudo-random numbers. Numerische Mathematik 17"101-123.Google ScholarGoogle Scholar
  5. Fincke, U., and M. Pohst. 1985. Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. Mathematics of Computation 44:463-471.Google ScholarGoogle ScholarCross RefCross Ref
  6. Fishman, G. S., and L. R. Moore III. 1986. An exhaustive analysis of multiplicative congruential random number generators with modulus 231 - 1. SlAM JournM on Scientific and Statistical Computing (Society for Industrial and Applied Mathematics) 7:24-45. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Grothe, H. 1988. Matrixgeneratoren zur Erzeugung gleichverteilter Pseudozufallsvektoren. Doctoral dissertation, Technische Hochschule Darmstadt, Germany. {Cited by L'Ecuyer (1992).}Google ScholarGoogle Scholar
  8. Knuth, D. E. 1969. The art of computer programming. Volume 2" Seminumerical algorithms. Reading, Massachusetts: Addison-Wesley. 2d ed., 1981. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. L'Ecuyer, P. 1992. Testing random number generators. In Proceedings of the 1902 Winter Simulation Conference, ed. J. J. Swain, D. Goldsman, R. C. Crain, and J. R. Wilson, 305-313. Institute of Electrical and Electronics Engineers, Piscataway, New Jersey. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. L'Ecuyer, P., and S. Tezuka. 1991. Structural properties for two classes of combined random number generators. Mathematics of Computation 57:735-746.Google ScholarGoogle ScholarCross RefCross Ref
  11. Leech, J. 1967. Notes on sphere packings. Canadian Journal of Mathematics 19:251-267.Google ScholarGoogle ScholarCross RefCross Ref
  12. Marsaglia, G. 1968. Random numbers fall mainly in the planes. Proceedings of the National Academy of Sciences of the United States of America 61:25-28.Google ScholarGoogle ScholarCross RefCross Ref
  13. Marsaglia, G., and A. Zaman. 1994. Some portable very-long-period random number generators. Computers in Physics 8"117-121. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Niederreiter, H. 1992. Random number generation and quasi-Monte Carlo methods. Philadelphia, Pennsylvania: Society for Industrial and Applied Mathematics. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Rogers, C. A. 1958. The packing of equal spheres. Proceedings of the London Mathematical Society, series 3, 8:609-620.Google ScholarGoogle ScholarCross RefCross Ref
  16. Wichmann, B. A., and I. D. Hill. 1982. Algorithm AS 183: An efficient and portable pseudo-random number generator. Applied Statistics 31:188-190. Corrected in the same journal 33:123.Google ScholarGoogle ScholarCross RefCross Ref
  17. Zeisel, H. 1986. A remark on "Algorithm AS 183: An efficient and portable pseudo-random number generator." Applied Statistics 35:89.Google ScholarGoogle Scholar

Index Terms

  1. Combination of multiplicative congruential random-number generators with safe prime modulus

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        WSC '95: Proceedings of the 27th conference on Winter simulation
        December 1995
        1493 pages
        ISBN:0780330188

        Publisher

        IEEE Computer Society

        United States

        Publication History

        • Published: 1 December 1995

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        WSC '95 Paper Acceptance Rate122of183submissions,67%Overall Acceptance Rate3,413of5,075submissions,67%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!