On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders

  • Frances Griffin
  • Harald Niederreiter
  • Igor E. Shparlinski
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1719)

Abstract

The nonlinear congruential method is an attractive alternative to the classical linear congruentialmethod for pseudorandom number generation. In this paper we present a new type of discrepancy bound for sequences of s-tuples of successive nonlinear multiple recursive congruential pseudorandom numbers of higher orders. In particular, we generalize some recent results about recursive congruential pseudorandom numbers of first order.

This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    T. Cochrane, ‘Trigonometric approximation and uniform distribution modulo 1’, Proc. Amer. Math. Soc., 103 (1988), 695–702.MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    P. Deligne, ‘Applications de la formule des traces aux sommes trigonométriques’, Lect. Notes in Mathematics, Springer-Verlag, Berlin, 569 (1977), 168–232.Google Scholar
  3. 3.
    M. Drmota and R.F. Tichy, Sequences, discrepancies and applications, Springer-Verlag, Berlin, 1997.MATHGoogle Scholar
  4. 4.
    J. Eichenauer-Herrmann, E. Herrmann and S. Wegenkittl, ‘A survey of quadratic and inversive congruential pseudorandom numbers’, Lect. Notes in Statistics, Springer-Verlag, Berlin, 127 (1998), 66–97.Google Scholar
  5. 5.
    M. Flahive and H. Niederreiter, ‘On inversive congruential generators for pseudorandom numbers’, Finite Fields, Coding Theory, and Advances in Communications and Computing (G.L. Mullen and P.J.-S. Shiue, eds)., Marcel Dekker, New York, 1993, 75–80.Google Scholar
  6. 6.
    J. B. Friedlander, D. Lieman and I. E. Shparlinski, ‘On the distribution of the RSA generator’, Proc. SETA ’98 (C.S. Ding, T. Helleseth and H. Niederreiter, eds)., Springer-Verlag, Singapore, (to appear).Google Scholar
  7. 7.
    J. B. Friedlander and I. E. Shparlinski, ‘On the distribution of the power generator’, Preprint, 1999.Google Scholar
  8. 8.
    J. Gutierrez, H. Niederreiter and I. E. Shparlinski, ‘On the multidimensional distribution of inversive congruentialps eudorandom numbers in parts of the period’, Monatsh. Math., (to appear).Google Scholar
  9. 9.
    D. Knuth, The art of computer programming, Vol. 2, 3rd ed., Addison-Wesley, Reading, MA, 1998.Google Scholar
  10. 10.
    R. Lidl and H. Niederreiter, ‘Finite fields and their applications’, Handbook of Algebra (M. Hazewinkel, ed.), Vol. 1, Elsevier, Amsterdam, 1996, 321–363.Google Scholar
  11. 11.
    R. Lidlan d H. Niederreiter, Finite fields, Cambridge University Press, Cambridge, 1997.Google Scholar
  12. 12.
    G. Marsaglia, ‘The structure of linear congruential sequences’, Applications of Number Theory to Numerical Analysis (S.K. Zaremba, ed.), Academic Press, New York, 1972, 249–285.Google Scholar
  13. 13.
    H. Niederreiter, Random number generation and quasi-Monte Carlo methods, SIAM, Philadelphia, 1992.MATHGoogle Scholar
  14. 14.
    H. Niederreiter, ‘Finite fields, pseudorandom numbers, and quasirandom points’, Finite Fields, Coding Theory, and Advances in Communications and Computing (G.L. Mullen and P.J.-S. Shiue, eds)., Marcel Dekker, New York, 1993, 375–394.Google Scholar
  15. 15.
    H. Niederreiter, ‘New developments in uniform pseudorandom number and vector generation’, Lect. Notes in Statistics, Springer-Verlag, Berlin, 106 (1995), 87–120.Google Scholar
  16. 16.
    H. Niederreiter and I. E. Shparlinski, ‘On the distribution of inversive congruential pseudorandom numbers in parts of the period’, Preprint, 1998.Google Scholar
  17. 17.
    H. Niederreiter and I. E. Shparlinski, ‘On the distribution and lattice structure of nonlinear congruential pseudorandom numbers’, Finite Fields and Their Appl., 5 (1999), 246–253.MATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    H. Niederreiter and I. E. Shparlinski, ‘On the distribution of pseudorandom numbers and vectors generated by inversive methods’, Preprint, 1999.Google Scholar
  19. 19.
    H. Niederreiter and I. E. Shparlinski, ‘Exponential sums and the distribution of inversive congruential pseudorandom numbers with prime-power modulus’, Acta Arith., (to appear).Google Scholar
  20. 20.
    S. B. Stečkin, ‘An estimate of a complete rationale xponential sum’, Trudy Mat. Inst. Steklov., 143 (1977), 188–207 (in Russian).MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Frances Griffin
    • 1
  • Harald Niederreiter
    • 2
  • Igor E. Shparlinski
    • 3
  1. 1.Department of ComputingMacquarie UniversitySydneyAustralia
  2. 2.Institute of Discrete MathematicsAustrian Academy of SciencesViennaAustria
  3. 3.Department of ComputingMacquarie UniversitySydneyAustralia

Personalised recommendations