On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
Jaime Gutiérrez, Igor E. Shparlinski, Arne Winterhof · IEEE Transactions on Information Theory · 2003
We obtain lower bounds on the linear and nonlinear complexity profile of a general nonlinear pseudorandom number generator, of the inversive generator, and of a new nonlinear generator called quadratic exponential generator. The results are interesting for applications to cryptography and Monte Carlo methods.