scientific article; zbMATH DE number 2124952
From MaRDI portal
Publication:4832278
Recommendations
- Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
- On the linear complexity profile of some new explicit inversive pseudorandom numbers
- On the linear complexity profile of explicit nonlinear pseudorandom numbers.
- On the counting function of the lattice profile of periodic sequences
- scientific article; zbMATH DE number 2051216
Cited in
(13)- Joint linear complexity of multisequences consisting of linear recurring sequences
- On the \(N\)th linear complexity of automatic sequences
- Pseudorandom sequences derived from automatic sequences
- A computational algebraic geometry approach to analyze pseudo-random sequences based on Latin squares
- On lattice profile of the elliptic curve linear congruential generators
- On the counting function of the lattice profile of periodic sequences
- Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences
- Enumeration results on linear complexity profiles and lattice profiles
- Continued fraction for formal Laurent series and the lattice structure of sequences
- Counting functions and expected values for the lattice profile at \(n\)
- On the structure of digital explicit nonlinear and inversive pseudorandom number generators
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
- On the Structure of Inversive Pseudorandom Number Generators
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4832278)
