Abstract
Nonlinear methods are attractive alternatives to the linear congruential method for pseudorandom number generation. We introduce a new particularly attractive explicit nonlinear congruential method and present nontrivial results on the distribution of pseudorandom numbers generated by this method over the full period and in parts of the period. The proofs are based on new bounds on certain exponential sums over finite fields.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Blahut, R.E.: Theory and Practice of Error Control Codes. Addison-Wesley, Reading (1983)
Cochrane, T.: On a trigonometric inequality of Vinogradov. J. Number Theory 27, 9–16 (1987)
Dorfer, G., Winterhof, A.: Lattice structure and linear complexity profile of nonlinear pseudorandom number generators. Appl. Algebra Engrg. Comm. Comput. 13, 499–508 (2003)
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, pp. 199–211. Springer, Berlin (2004)
Eichenauer-Herrmann, J.: Statistical independence of a new class of inversive congruential pseudorandom numbers. Math. Comp. 60, 375–384 (1993)
Gutierrez, J., Niederreiter, H., Shparlinski, I.: On the multidimensional distribution of inversive congruential pseudorandom numbers in parts of the period. Monatsh. Math. 129, 31–36 (2000)
Jungnickel, D.: Finite Fields: Structure and Arithmetics. Bibliographisches Institut, Mannheim (1993)
Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, Cambridge (1997)
Marsaglia, G.: The structure of linear congruential sequences. In: Zaremba, S.K. (ed.) Applications of Number Theory to Numerical Analysis, pp. 249–285. Academic Press, New York (1972)
Meidl, W., Winterhof, A.: On the linear complexity profile of some new explicit inversive pseudorandom numbers. J. Complexity 20, 350–355 (2004)
Mordell, L.J.: On a sum analogous to a Gauss’s sum. Quart. J. Math. 3, 161–167 (1932)
Moreno, C.J., Moreno, O.: Exponential sums and Goppa codes: I. Proc. Amer. Math. Soc. 111, 523–531 (1991)
Niederreiter, H.: Statistical independence of nonlinear congruential pseudorandom numbers. Monatsh. Math. 106, 149–159 (1988)
Niederreiter, H.: Random Number Generation and Quasi-Monte Carlo Methods. SIAM, Philadelphia (1992)
Niederreiter, H., Shparlinski, I.: On the distribution and lattice structure of nonlinear congruential pseudorandom numbers. Finite Fields Appl. 5, 246–253 (1999)
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)
Niederreiter, H., Winterhof, A.: Lattice structure and linear complexity of nonlinear pseudorandom numbers. Appl. Algebra Engrg. Comm. Comput. 13, 319–326 (2002)
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)
Schmidt, W.M.: Equations over Finite Fields. Lecture Notes in Mathematics, vol. 536. Springer, Berlin (1976)
Winterhof, A.: 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 (2004) (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Niederreiter, H., Winterhof, A. (2005). On the Distribution of Some New Explicit Nonlinear Congruential Pseudorandom Numbers. In: Helleseth, T., Sarwate, D., Song, HY., Yang, K. (eds) Sequences and Their Applications - SETA 2004. SETA 2004. Lecture Notes in Computer Science, vol 3486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11423461_19
Download citation
DOI: https://doi.org/10.1007/11423461_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26084-4
Online ISBN: 978-3-540-32048-7
eBook Packages: Computer ScienceComputer Science (R0)