𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the linear complexity profile of explicit nonlinear pseudorandom numbers

✍ Scribed by Wilfried Meidl; Arne Winterhof

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
95 KB
Volume
85
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

On the Distribution and Lattice Structur
On the Distribution and Lattice Structure of Nonlinear Congruential Pseudorandom Numbers
✍ 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