𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators

✍ Scribed by Gutierrez, J.; Shparlinski, I.E.; Winterhof, A.


Book ID
114636932
Publisher
IEEE
Year
2003
Tongue
English
Weight
421 KB
Volume
49
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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.

On the Distribution and Lattice Structur
✍ Harald Niederreiter; Igor E. Shparlinski πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 106 KB

The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. In this paper we present a new type of discrepancy bound for sequences of s-tuples of successive nonlinear congruential pseudorandom numbers and a result on