Skip to main content

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

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((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 via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Cochrane, ‘Trigonometric approximation and uniform distribution modulo 1’, Proc. Amer. Math. Soc., 103 (1988), 695–702.

    Article  MATH  MathSciNet  Google Scholar 

  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. M. Drmota and R.F. Tichy, Sequences, discrepancies and applications, Springer-Verlag, Berlin, 1997.

    MATH  Google Scholar 

  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. 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. 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. J. B. Friedlander and I. E. Shparlinski, ‘On the distribution of the power generator’, Preprint, 1999.

    Google Scholar 

  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. D. Knuth, The art of computer programming, Vol. 2, 3rd ed., Addison-Wesley, Reading, MA, 1998.

    Google Scholar 

  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. R. Lidlan d H. Niederreiter, Finite fields, Cambridge University Press, Cambridge, 1997.

    Google Scholar 

  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. H. Niederreiter, Random number generation and quasi-Monte Carlo methods, SIAM, Philadelphia, 1992.

    MATH  Google Scholar 

  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. 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. H. Niederreiter and I. E. Shparlinski, ‘On the distribution of inversive congruential pseudorandom numbers in parts of the period’, Preprint, 1998.

    Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  18. H. Niederreiter and I. E. Shparlinski, ‘On the distribution of pseudorandom numbers and vectors generated by inversive methods’, Preprint, 1999.

    Google Scholar 

  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. S. B. Stečkin, ‘An estimate of a complete rationale xponential sum’, Trudy Mat. Inst. Steklov., 143 (1977), 188–207 (in Russian).

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Griffin, F., Niederreiter, H., Shparlinski, I.E. (1999). On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders. In: Fossorier, M., Imai, H., Lin, S., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1999. Lecture Notes in Computer Science, vol 1719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46796-3_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-46796-3_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66723-0

  • Online ISBN: 978-3-540-46796-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics