𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers

✍ Scribed by Harald Niederreiter; Arne Winterhof

Publisher
Springer
Year
2002
Tongue
English
Weight
71 KB
Volume
13
Category
Article
ISSN
0938-1279

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the linear complexity profile of expl
On the linear complexity profile of explicit nonlinear pseudorandom numbers
✍ 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
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

An efficient lattice reduction method fo
An efficient lattice reduction method for -linear pseudorandom number generators using Mulders and Storjohann algorithm
✍ Shin Harase πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 241 KB

Recent simulations often use highly parallel machines with many processors, and they need many pseudorandom number generators with distinct parameter sets, and hence we need an effective fast assessment of the generator with a given parameter set. Linear generators over the two-element field are goo