On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders
DOI10.1007/S00200-005-0181-0zbMath1114.11066OpenAlexW2161451071MaRDI QIDQ2573796
Arne Winterhof, Alev Topuzoğlu
Publication date: 24 November 2005
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-005-0181-0
Linear complexity profileInversive generatorsNonlinear pseudorandom number generatorsSequences over finite fieldsRecurrences of higher order
Cryptography (94A60) Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (2)
Cites Work
- On the period length of congruential pseudorandom number sequences generated by inversions
- A multiple recursive nonlinear congruential pseudo random number generator
- Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
- On the linear complexity profile of some new explicit inversive pseudorandom numbers
- Lattice structure and linear complexity of nonlinear pseudorandom numbers
- Permutation polynomials, de Bruijn sequences, and linear complexity
- On the distribution and lattice structure of nonlinear congruential pseudorandom numbers
- On the distribution of inversive congruential pseudorandom numbers in parts of the period
- On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
- The period lengths of inversive congruential recursions
- Progress in Cryptology - INDOCRYPT 2003
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders