On pseudorandom numbers from multivariate polynomial systems
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.
- Multivariate permutation polynomial systems and nonlinear pseudorandom number generators
- Pseudorandom numbers and hash functions from iterations of multivariate polynomials
- scientific article; zbMATH DE number 2081136
- Pseudorandom Vector Sequences Derived from Triangular Polynomial Systems with Constant Multipliers
- Pseudorandom bits for polynomials
- On the generation of random stable polynomials
- Pseudorandom generators for low degree polynomials
- Quasi-random multilinear polynomials
- Attacking the Pollard Generator
- Cryptography and Coding
- Deciphering a linear congruential encryption
- Exponential sums for nonlinear recurring sequences
- How to predict congruential generators
- scientific article; zbMATH DE number 17389 (Why is no real title available?)
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 1982610 (Why is no real title available?)
- scientific article; zbMATH DE number 2081136 (Why is no real title available?)
- scientific article; zbMATH DE number 1504654 (Why is no real title available?)
- scientific article; zbMATH DE number 3440485 (Why is no real title available?)
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
- Information Security and Privacy
- Lattice reduction: a toolbox for the cryptoanalyst
- Multivariate permutation polynomial systems and nonlinear pseudorandom number generators
- On the average distribution of pseudorandom numbers generated by nonlinear permutations
- On the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators
- On the distribution and lattice structure of nonlinear congruential pseudorandom numbers
- On the distribution of inversive congruential pseudorandom numbers in parts of the period
- Predicting nonlinear pseudorandom number generators
- Pseudorandom numbers and hash functions from iterations of multivariate polynomials
- Pseudorandom sequences
- Pseudorandom Vector Sequences Derived from Triangular Polynomial Systems with Constant Multipliers
- Quasi-Monte Carlo methods and pseudo-random numbers
- Reconstructing Truncated Integer Variables Satisfying Linear Congruences
- Sequences, discrepancies and applications
- Hyperbolic automorphisms of tori and pseudo-random sequences
- The generalized polynomial Moon-Rand system
- Optimal characteristic polynomials for digital multistep pseudorandom numbers
- Predicting masked linear pseudorandom number generators over finite fields
- Pseudorandom numbers and hash functions from iterations of multivariate polynomials
- Multiplicative character sums of a class of nonlinear recurrence vector sequences
- Pseudorandom Vector Sequences Derived from Triangular Polynomial Systems with Constant Multipliers
- On the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators
- On the power generator and its multivariate analogue
- scientific article; zbMATH DE number 2081136 (Why is no real title available?)
- Full orbit sequences in affine spaces via fractional jumps and pseudorandom number generation
- Invariants and conjugacy classes of triangular polynomial maps
- Pseudorandom vector sequences of maximal period generated by triangular polynomial dynamical systems
- Multivariate permutation polynomial systems and nonlinear pseudorandom number generators
This page was built for publication: On pseudorandom numbers from multivariate polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708433)
