On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators

IEEE Transactions on Information Theory

Volumn 49, Issue 1, 2003, Pages 60-64

  Gutierrez, Jaime ^a   Shparlinski, Igor E ^d   Winterhof, Arne ^b,c  

^a UNIVERSITY OF CANTABRIA   (Spain)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c ERICH SCHMID INSTITUTE OF MATERIALS SCIENCE   (Austria)

^d NONE

Author keywords

Inversive generator; Linear and nonlinear complexity profile; Nonlinear pseudorandom number generators; Quadratic exponential generator

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; MATHEMATICAL MODELS; MONTE CARLO METHODS; POLYNOMIALS;

QUADRATIC EXPONENTIAL GENERATORS;

RANDOM NUMBER GENERATION;

EID: 0037265750     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.806144     Document Type: Article

References (35)

1. L. Blum, M. Blum, and M. Shub, "A simple unpredictable pseudo-random number generator," SIAM J. Comput., vol. 15, pp. 364-383, 1986.
2. D. Coppersmith and I. E. Shparlinski, "On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping," J. Cryptol., vol. 13, pp. 339-360, 2000.
3. T. W. Cusick, C. Ding, and A. Renvall, Stream Ciphers and Number Theory. Amsterdam, The Netherlands: North-Holland, 1998.
4. J. Eichenauer-Herrmann, E. Herrmann, and S. Wegenkittl, "A survey of quadratic and inversive congruential pseudorandom numbers," in Monte Carlo and Quasi-Monte Carlo Methods (Lecture Notes in Statistics). New York: Springer-Verlag, 1996, vol. 127, pp. 66-97.
5. M. Flahive and H. Niederreiter, "On inversive congruential generators for pseudorandom numbers," in Finite Fields, Coding Theory, and Advances in Communications and Computing (Lecture Notes in Pure and Appl. Math.). New York: Dekker, 1993, 141, pp. 75-80.
6. J.B. Friedlander, J. Hansen, and I. E. Shparlinski, "On character sums with exponential functions," Mathematika, vol. vol. 47, pp. 75-85, 2000.
7. _, "On the distribution of the power generator modulo a prime power," in Proc. DIMACS Workshop Unusual Applications of Number Theory, 2000, to be published.
8. m," Acta Arith., to be published.
9. J. B. Friedlander, C. Pomerance, and I. E. Shparlinski, "Period of the power generator and small values of Carmichael's function," Math. Comput., vol. 70, pp. 1591-1605, 2001.
10. J. B. Friedlander and I. E. Shparlinski, "On the distribution of the power generator," Math. Comput., vol. 70, pp. 1575-1589, 2001.
11. F. Griffin, H. Niederreiter, and I. E. Shparlinski, "On the distribution of nonlinear recursive congruential pseudorandom numbers of higher orders," in Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 1999, vol. 1719, pp. 87-93.
12. F. Griffin and I. E. Shparlinski, "On the linear complexity profile of the power generator," IEEE Trans. Inform. Theory, vol. 46, pp. 2159-2162, Sept. 2000.
13. J. Gutierrez and D. Gomez-Perez, "Iterations of multivariate polynomials and discrepancy of pseudorandom numbers," in Proc. 14th Symp. Applied Algebra Algebraic Alg. Error-Correcting Codes (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2001, vol. 2227, pp. 192-199.
14. J. Gutierrez, H. Niederreiter, and I. E. Shparlinski, "On the multidimensional distribution of inversive congruential pseudorandom numbers in parts of the period," Monatsh. Math., vol. 129, pp. 31-36, 2000.
15. A. Joux and J. Stem, "Lattice reduction: A toolbox for the cryptanalyst," J. Cryptol., vol. 11, pp. 161-185, 1998.
16. J. C. Lagarias, "Pseudorandom number generators in cryptography and number theory," in Cryptology and Computational Number Theory (Proc. Symp. Appl. Math.). Providence, RI: Amer. Math. Soc., 1989, pp. 115-143.
17. W. Meidl and A. Winterhof, "On the linear complexity profile of explicit nonlinear pseudorandom numbers," Inform. processing Lett., to be published.
18. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone, Handbook of Applied Cryptography. Boca Raton, FL: CRC, 1997.
19. H. Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods. Philadelphia, PA: SIAM, 1992.
20. _, "New developments in uniform pseudorandom number and vector generation," in Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing (Lecture Notes in Statistics). New York: Springer-Verlag, 1994, pp. 87-120.
21. _, "Some computable complexity measures for binary sequences," in Proc. Int. Conf. Sequences and Their Applications (SETA '98), Singapore. London: Springer, 1999, pp. 67-78.
22. _, "Design and analysis of nonlinear pseudorandom number generators," in Monte Carlo Simulation. Rotterdam, The Netherlands: A. A. Balkema, 2001, pp. 3-9.
23. H. Niederreiter and I. E. Shparlinski, "On the distribution and lattice structure of nonlinear congruential pseudorandom numbers," Finite Fields Their Appl., vol. 5, pp. 246-253, 1999.
24. _, "Exponential sums and the distribution of inversive congruential pseudorandom numbers with prime-power modulus," Acta Arith., vol. 92, pp. 89-98, 2000.
25. _, "On the distribution of pseudorandom numbers and vectors generated by inversive methods," Appl. Algebra Engrg. Comm. Comput., vol. 10, pp. 189-202, 2000.
26. _, "On the distribution of inversive congruential pseudorandom numbers in parts of the period," Math. Comput., vol. 70, pp. 1569-1574, 2001.
27. _, "Recent advances in the theory of nonlinear pseudorandom number generators," in Proc. Conf. Monte Carlo and Quasi-Monte Carlo Methods (2000). Berlin, Germany: Springer-Verlag, 2002, pp. 86-102.
28. _, "On the average distribution of inversive pseudorandom numbers," Finite Fields and Their Appl., vol. 8, pp. 491-503, 2002.
29. H. Niederreiter and A. Winterhof, "Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number," Acta Arith., vol. 93, pp. 387-399, 2000.
30. _ "On the distribution of compound inversive congruential pseudo-random numbers," Monatsh. Math., vol. 132, pp. 35-48, 2001.
31. _, "On a new class of inversive pseudorandom numbers for parallelized simulation methods," Period. Math. Hungar., vol. 42, pp. 77-87, 2001.
32. _, "Lattice structure and linear complexity of nonlinear pseudo-random numbers," Appl. Algebra in Eng. Commun. and Computing, vol. 13, pp. 319-326, 2003.
33. R. A. Rueppel, "Stream ciphers," in Contemporary Cryptology: The Science of Information Integrity. New York: IEEE, 1992, pp. 65-134.
34. I. E. Shparlinski, "On the linear complexity of the power generator," Des. Codes Cryptogr., vol. 23, pp. 5-10, 2001.
35. D. R. Stinson, Cryptography: Theory and Practice. Boca Raton, FL: CRC, 1995.