On the linear complexity profile of explicit nonlinear pseudorandom numbers
Bounds on the linear complexity profile of a general explicit nonlinear pseudorandom number generator are obtained. For some special explicit nonlinear generators including the explicit inversive generator these results are improved. (C) 2002 Elsevier Science B.V All rights reserved.
linear complexity profile explicit nonlinear pseudorandom number generator explicit inversive generator computational complexity cryptography