On the linear complexity profile of explicit nonlinear pseudorandom numbers

Information Processing Letters

Volumn 85, Issue 1, 2003, Pages 13-18

  Meidl, Wilfried ^a   Winterhof, Arne ^a  

^a ERICH SCHMID INSTITUTE OF MATERIALS SCIENCE   (Austria)

Author keywords

Computational complexity; Cryptography; Explicit inversive generator; Explicit nonlinear pseudorandom number generator; Linear complexity profile

Indexed keywords

CRYPTOGRAPHY; FUNCTIONS; MONTE CARLO METHODS; POLYNOMIALS; RANDOM NUMBER GENERATION; THEOREM PROVING;

NONLINEAR GENERATORS;

COMPUTATIONAL COMPLEXITY;

EID: 0037448287     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00335-6     Document Type: Article

References (21)

1. Blackburn S.R., Etzion T., Paterson K.G. Permutation polynomials, de Bruijn sequences, and linear complexity. J. Comb. Theory A. 76:1996;55-82.
2. Cusick T.W., Ding C., Renvall A. Stream Ciphers and Number Theory. 1998;North-Holland, Amsterdam.
3. Eichenauer-Herrmann J. Statistical independence of a new class of inversive congruential pseudorandom numbers. Math. Comp. 60:1993;375-384.
4. Eichenauer-Herrmann J., Herrmann E., Wegenkittl S. A survey of quadratic and inversive congruential pseudorandom numbers. Monte Carlo and Quasi-Monte Carlo Methods, Salzburg. 1996;Lecture Notes in Statistics. 127:1998;66-97 Springer, New York.
5. Granville A. Arithmetic properties of binomial coefficients. I. Binomial coefficients modulo prime powers. Organic Mathematics, Burnaby, BC. 1995;CMS Conf. Proc., Vol. 20. 1997;253-276 Amer. Mathematical Society, Providence, RI.
6. J. Gutierrez, I. Shparlinski, A. Winterhof, On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators, IEEE Trans. Inform. Theory, to appear.
7. Jungnickel D. Finite Fields: Structure and Arithmetics. 1993;Bibliographisches Institut, Mannheim.
8. Lucas M.E. Sur les congruences des nombres euleriennes et des coefficients différentiels des functions trigonométriques, suivant un-module premier. Bull. Soc. Math. France. 6:1878;49-54.
9. Massey J.L. Shift-register synthesis and BCH decoding. IEEE Trans. Inform. Theory. 15:1969;122-127.
10. Mclntosh R.J. A generalization of a congruential property of Lucas. Amer. Math. Monthly. 99:1992;231-238.
11. Meidl W., Winterhof A. Linear complexity and polynomial degree of a function over a finite field, finite fields and applications. Proceedings of the 6th International Conference, Oaxaca, Mexico. 2001.
12. Menezes A.J., van Oorschot P.C., Vanstone S.A. Handbook of Applied Cryptography. 1997;CRC Press, Boca Raton, FL.
13. Niederreiter H. Random Number Generation and Quasi-Monte Carlo Methods. 1992;SIAM, Philadelphia.
14. Niederreiter H. New developments in uniform pseudorandom number and vector generation. Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing, Las Vegas, NV. 1994;Lecture Notes in Statistics. 106:1995;87-120 Springer, New York.
15. Niederreiter H. Some computable complexity measures for binary sequences. Ding C., Helleseth T., Niederreiter H. Sequences and Their Applications. 1999;67-78 Springer, London.
16. Niederreiter H. Design and analysis of nonlinear pseudorandom number generators. Monte Carlo Simulation. 2001;3-9 Balkema, Rotterdam.
17. Niederreiter H., Shparlinski I.E. Recent advances in the theory of nonlinear pseudorandom number generators. Fang K.-T., Hickernell F.J., Niederreiter H. Monte Carlo and Quasi-Monte Carlo Methods 2000. 2002;86-102 Springer, Berlin.
18. Niederreiter H., Winterhof A. Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators. Acta Arith. 93:2000;387-399.
19. Niederreiter H., Winterhof A. On the lattice structure of pseudorandom numbers generated over arbitrary finite fields. Appl. Alg. Engrg. Comm. Comp. 12:2001;265-272.
20. Rueppel R.A. Analysis and Design of Stream Ciphers. 1986;Springer, Berlin.
21. Rueppel R.A. Stream ciphers. Contemporary Cryptology: The Science of Information Integrity. 1992;65-134 IEEE Press, New York.