Skip to main content

On the Distribution of Some New Explicit Inversive Pseudorandom Numbers and Vectors

  • Conference paper
Monte Carlo and Quasi-Monte Carlo Methods 2004

Summary

Inversive methods are attractive alternatives to the linear method for pseudorandom number generation. A particularly attractive method is the new explicit inversive method recently introduced by Meidl and the author. We present nontrivial results on the distribution of pseudorandom numbers and vectors generated by this method over the full period and in parts of the period. Moreover, we establish some new results on the statistical properties of parallel streams of such pseudorandom numbers. These results demonstrate that the new method is eminently suitable for the generation of parallel streams of pseudorandom numbers with desirable properties. The proofs are based on new bounds on certain exponential sums over finite fields.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Cochrane, T.: On a trigonometric inequality of Vinogradov. J. Number Theory, 27, 9–16 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  2. Cochrane, T., Peral, J.C.: An asymptotic formula for a trigonometric sum of Vinogradov. J. Number Theory, 91, 1–19 (2002)

    Article  MathSciNet  Google Scholar 

  3. Dorfer, G., Winterhof, A.: Lattice structure and linear complexity profile of nonlinear pseudorandom number generators. Appl. Algebra Engrg. Comm. Comp., 13, 499–508 (2003)

    Article  MathSciNet  Google Scholar 

  4. Dorfer, G., Winterhof, A.: Lattice structure of nonlinear pseudorandom number generators in parts of the period. In: Niederreiter, H. (ed) Monte Carlo and Quasi-Monte Carlo Methods 2002. Springer, New York, 199–211 (2004)

    Google Scholar 

  5. Eichenauer-Herrmann, J.: Statistical independence of a new class of inversive congruential pseudorandom numbers. Math. Comp., 60, 375–384 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  6. Hellekalek, P.: General discrepancy estimates: the Walsh function system. Acta Arith., 67, 209–218 (1994)

    MATH  MathSciNet  Google Scholar 

  7. Itoh, T., Tsujii, S.: A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases. Inform. and Comput., 78, 171–177 (1988)

    Article  MathSciNet  Google Scholar 

  8. Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications, revised ed. Cambridge University Press, Cambridge (1994)

    Google Scholar 

  9. Marsaglia, G.: The structure of linear congruential sequences. In: Zaremba, S.K. (ed) Applications of Number Theory to Numerical Analysis. Academic Press, New York, 249–285 (1972)

    Google Scholar 

  10. Meidl, W., Winterhof, A.: On the linear complexity profile of some new explicit inversive pseudorandom numbers. J. Complexity, 20, 350–355 (2004)

    Article  MathSciNet  Google Scholar 

  11. Mishra, P.K., Sarkar, P.: Application of Montgomery’s trick to scalar multiplication for elliptic and hyperelliptic curves using a fixed base point. In: Bao, F., Deng, R., Zhou, J. (eds) Public Key Cryptography—PKC 2004. Lecture Notes in Comput. Sci., 2947, Springer, Berlin, 41–54 (2004)

    Google Scholar 

  12. Montgomery, P.L.: Speeding the Pollard and elliptic curve methods of factorization. Math. Comp., 48, 243–264 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  13. Moreno, C.J., Moreno, O.: Exponential sums and Goppa codes: I. Proc. Amer. Math. Soc., 111, 523–531 (1991)

    Article  MathSciNet  Google Scholar 

  14. Niederreiter, H.: Random Number Generation and Quasi-Monte Carlo Methods. SIAM, Philadelphia (1992)

    Google Scholar 

  15. Niederreiter, H.: On a new class of pseudorandom numbers for simulation methods. J. Comp. Appl. Math., 56, 159–167 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  16. Niederreiter, H.: Pseudorandom vector generation by the inversive method. ACM Trans. Modeling and Computer Simulation, 4, 191–212 (1994)

    Article  MATH  Google Scholar 

  17. Niederreiter, H.: Improved bounds in the multiple-recursive matrix method for pseudorandom number and vector generation. Finite Fields Appl., 2, 225–240 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  18. Niederreiter, H., Shparlinski, I.E.: On the distribution of inversive congruential pseudorandom numbers in parts of the period. Math. Comp., 70, 1569–1574 (2001)

    Article  MathSciNet  Google Scholar 

  19. Niederreiter, H., Winterhof, A.: Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators. Acta Arith., 93, 387–399 (2000)

    MathSciNet  Google Scholar 

  20. Niederreiter, H., Winterhof, A.: On the lattice structure of pseudorandom numbers generated over arbitrary finite fields. Appl. Algebra Engrg. Comm. Comp., 12, 265–272 (2001)

    Article  MathSciNet  Google Scholar 

  21. Niederreiter, H., Winterhof, A.: On a new class of inversive pseudorandom numbers for parallelized simulation methods. Periodica Mathematica Hungarica, 42, 77–87 (2001)

    Article  MathSciNet  Google Scholar 

  22. Perel’muter, G.I.: Estimate of a sum along an algebraic curve (Russian). Mat. Zametki, 5, 373–380 (1969); Engl. transl. Math. Notes, 5, 223–227 (1969)

    MathSciNet  Google Scholar 

  23. Shacham, H., Boneh, D.: Improving SSL handshake performance via batching. In: Topics in Cryptology—CT-RSA 2001 (San Francisco, CA). Lecture Notes in Comput. Sci., 2020, Springer, Berlin, 28–43 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Winterhof, A. (2006). On the Distribution of Some New Explicit Inversive Pseudorandom Numbers and Vectors. In: Niederreiter, H., Talay, D. (eds) Monte Carlo and Quasi-Monte Carlo Methods 2004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-31186-6_30

Download citation

Publish with us

Policies and ethics