On the linear complexity and lattice test of nonlinear pseudorandom number generators
From MaRDI portal
Publication:2811672
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
Cited in
(11)- Subgroups generated by rational functions in finite fields
- On the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials
- On the lattice structure of inversive PRNG via the additive order
- 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
- Hamming correlation of higher order
- scientific article; zbMATH DE number 5174819 (Why is no real title available?)
- 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)
