On the linear complexity and lattice test of nonlinear pseudorandom number generators
From MaRDI portal
Publication:2811672
zbMATH Open1368.11081MaRDI QIDQ2811672FDOQ2811672
Authors: Domingo Gómez-Pérez, Jaime Gutierrez 
Publication date: 10 June 2016
Recommendations
- On the lattice structure of inversive PRNG via the additive order
- Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
- On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders
- On the structure of digital explicit nonlinear and inversive pseudorandom number generators
- Lattice structure and linear complexity of nonlinear pseudorandom numbers
Random number generation in numerical analysis (65C10) Irregularities of distribution, discrepancy (11K38) Distribution modulo one (11J71) Pseudo-random numbers; Monte Carlo methods (11K45)
Cited In (11)
- Subgroups generated by rational functions in finite fields
- On the lattice structure of inversive PRNG via the additive order
- On the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials
- On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators
- On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators
- Title not available (Why is that?)
- Hamming correlation of higher order
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
- On the linear complexity profile of some new explicit inversive pseudorandom numbers
- On the linear complexity profile of explicit nonlinear pseudorandom numbers.
- On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders
This page was built for publication: On the linear complexity and lattice test of nonlinear pseudorandom number generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811672)
