Finite fields
Subresultants under composition
Journal of Symbolic Computation
Guaranteeing the diversity of number generators
Information and Computation
On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Iterations of Multivariate Polynomials and Discrepancy of Pseudorandom Numbers
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Applicable Algebra in Engineering, Communication and Computing
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
Recent results on recursive nonlinear pseudorandom number generators
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
IEEE Transactions on Information Theory
Multivariate permutation polynomial systems and nonlinear pseudorandom number generators
Finite Fields and Their Applications
On pseudorandom numbers from multivariate polynomial systems
Finite Fields and Their Applications
Exponential sums for nonlinear recurring sequences
Finite Fields and Their Applications
On the Distribution and Lattice Structure of Nonlinear Congruential Pseudorandom Numbers
Finite Fields and Their Applications
| Hi-index | 0.00 |
Nonlinear congruential pseudorandom number generators can have unexpectedly short periods. Shamir and Tsaban introduced the class of counter-dependent generators which admit much longer periods. In this paper we present a bound for multiplicative character sums for nonlinear sequences generated by counter-dependent generators.