On the linear complexity profile of expl
โ
Wilfried Meidl; Arne Winterhof
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 95 KB
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.