Lattice structure and linear complexity of nonlinear pseudorandom numbers

Applicable Algebra in Engineering, Communications and Computing

Volumn 13, Issue 4, 2002, Pages 319-326

  Niederreiter, Harald ^a   Winterhof, Arne ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b ERICH SCHMID INSTITUTE OF MATERIALS SCIENCE   (Austria)

Author keywords

Inversive method; Linear complexity; Marsaglia's lattice test; Nonlinear method; Pseudorandom number generator

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; THEOREM PROVING; VECTORS;

INVERSIVE METHOD; LATTICE STRUCTURE; LINEAR COMPLEXITY; MARSAGLIA LATTICE TEST; NONLINEAR METHOD; PSEUDORANDOM NUMBER GENERATORS;

RANDOM NUMBER GENERATION;

EID: 0036955497     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002000200105     Document Type: Article

References (24)

1. Blackburn, S.R., Etzion, T., Paterson, K.G.: Permutation polynomials, de Bruijn sequences, and linear complexity. J. Comb. Th. A 76 (1), 55-82 (1996)
2. Chou, W.-S.: The period lengths of inversive pseudorandom vector generations. Finite Fields Appl. 1 (1), 126-132 (1995)
3. Chou, W.-S., Niederrieter, H.: On the lattice test for inversive congruential pseudorandom numbers. Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing. Lecture Notes in Statistics pp. 186-197. New York: Springer 1995
4. Cusick, T. W., Ding, C., Renvall, A.: Stream Ciphers and Number Theory. Amsterdam: Elsevier 1998
5. Eichenauer, J., Grothe, H., Lehn, J.: Marsaglia's lattice test and non-linear congruential pseudo random number generators. Metrika 35 (3/4), 241-250 (1988)
6. Eichenauer-Herrmann, J., Herrmann, E., Wegenkittl, S.: A survey of quadratic and inversive congruential pseudorandom numbers. In: Niederreiter, H., et al. (eds.): Monte Carlo and Quasi-Monte Carlo Methods 1996. Lecture Notes in Statistics 127, pp. 66-97, New York: Springer 1998
7. Eichenauer-Herrmann, J., Niederreiter, H.: Digital inversive pseudorandom numbers. ACM Trans. Modeling and Computer Simulation 4 (4), 339-349 (1994)
8. Flahive, M., Niederreiter, H.: On inversive congruential generators for pseudorandom numbers. In: Finite Fields, Coding Theory, and Advances in Communications and Computing (Las Vegas, NV, 1991), Lecture Notes in Pure and Appl. Math. 141, pp. 75-80. New York: Dekker 1993
9. Gutierrez, J., Niederrieter, H., Shparlinski, I. E.: On the multidimensional distribution of inversive congruential pseudorandom numbers in parts of the period. Monatsh. Math. 129 (1), 31-36 (2000)
10. Levin, M. B.: Explicit digital inversive pseudorandom numbers. Math. Slovaca 50(5), 581-598 (2000)
11. Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications, rev. ed. Cambridge: Cambridge University Press 1994
12. Marsaglia, G.: The structure of linear congruential sequences. In: Zaremba, S.K. (ed.): Applications of Number Theory to Numerical Analysis, pp. 249-285. New York: Academic Press 1972
13. Meidl, W., Winterhof, A.: Lower bounds on the linear complexity of the discrete logarithm in finite fields. IEEE Trans. Inform. Th. 47, 2807-2811 (2001)
14. Meidl, W., Winterhof, A.: A polynomial representation of the Diffie-Hellman mapping. Appl. Alg. Engrg. Comm. Comp., to appear
15. Meidl, W., Winterhof, A.: Linear complexity and polynomial degree of a function over a finite field. In: Proc. 6th Conf. Finite Fields and Applications, to appear
16. Mullen, G. L., White, D.: A polynomial representation for logarithms in G F (q). Acta Arith. 47 (3), 255-261 (1986)
17. Niederreiter, H.: Random Number Generation and Quasi-Monte Carlo Methods. Philadelphia: SIAM 1992
18. Niederreiter, H.: Pseudorandom vector generation by the inversive method. ACM Trans. Modeling and Computer Simulation 4 (2), 191-212 (1994)
19. Niederreiter, H.: New developments in uniform pseudorandom number and vector generation. In: Niederreiter, H., Shiue, P.J.-S. (eds.): Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing. Lecture Notes in Statistics 106, pp. 87-120. New York: Springer 1995
20. Niederreiter, H., Shparlinski, I. E.: On the distribution and lattice structure of nonlinear congruential pseudorandom numbers. Finite Fields Appl. 5 (3), 246-253 (1999)
21. Niederreiter, H., Shparlinski, I. E.: Recent advances in the theory of nonlinear pseudorandom number generators. In: Fang, K.-T., Hickernell, F.J., Niederreiter, H. (eds.): Monte Carlo and Quasi-Monte Carlo Methods 2000, pp. 86-102. Berlin: Springer 2002
22. Niederreiter, H., Winterhof, A.: Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators. Acta Arith. 93 (4), 387-399 (2000)
23. Niederreiter, H., Winterhof, A.: On the lattice structure of pseudorandom numbers generated over arbitrary finite fields. Appl. Alg. Engrg. Comm. Comp. 12 (3), 265-272 (2001)
24. Shparlinski, I. E.: Number Theoretic Methods in Cryptography. Basel: Birkhäuser 1999