On pseudorandom numbers from multivariate polynomial systems (Q708433)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On pseudorandom numbers from multivariate polynomial systems |
scientific article |
Statements
On pseudorandom numbers from multivariate polynomial systems (English)
0 references
11 October 2010
0 references
This paper deals with sequences of vectors \(\mathbf{u}_n=(u_{n,1,},\ldots,u_{n,m})\in\mathbb{F}_p^m\) generated by multivariate polynomial systems. The vectors \(\mathbf{u}_n\) are defined by a recurrence congruence modulo the prime \(p\), \[ u_{n+1,i}=f_i(u_{n,1},\ldots,u_{n,m}),\;n=0,1,\ldots, \] with initial values \(\mathbf{u}_0=(u_{0,1},\ldots,u_{0,m})\), where \(f_1(X_1,\ldots,X_m),\ldots,f_m (X_1,\ldots,X_m)\) are polynomials over \(\mathbb{F}_p\). The authors derive bounds on exponential sums along the orbits of such polynomial systems. These bounds hold for essentially arbitrary polynomial systems with sufficiently long orbits, and they can be applied, via the Erdős-Turán-Koksma inequality, to deriving discrepancy bounds for sequences of pseudorandom vectors based on the sequence of the \(\mathbf{u}_n\). The approach in this paper, in comparison to previous results, does not require control of the degree growth of the iterations of the polynomial system.
0 references
multivariate polynomial
0 references
pseudorandom number generator
0 references
discrepancy
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references