Pages that link to "Item:Q2811672"
From MaRDI portal
The following pages link to On the linear complexity and lattice test of nonlinear pseudorandom number generators (Q2811672):
Displaying 10 items.
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations (Q437681) (← links)
- Hamming correlation of higher order (Q1784990) (← links)
- On the linear complexity profile of some new explicit inversive pseudorandom numbers (Q1827574) (← links)
- On the linear complexity profile of explicit nonlinear pseudorandom numbers. (Q1853169) (← links)
- On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators (Q2229848) (← links)
- Subgroups generated by rational functions in finite fields (Q2255262) (← links)
- On the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials (Q2491293) (← links)
- On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders (Q2573796) (← links)
- On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators (Q3000561) (← links)
- (Q5294885) (← links)