Pseudorandom numbers and hash functions from iterations of multivariate polynomials
From MaRDI portal
Publication:2380848
DOI10.1007/s12095-009-0016-0zbMath1185.11049arXiv0908.4519OpenAlexW2037462567MaRDI QIDQ2380848
Alina Ostafe, Igor E. Shparlinski
Publication date: 12 April 2010
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0908.4519
Cryptography (94A60) Exponential sums (11T23) Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (8)
MULTIPLICATIVE CHARACTER SUMS OF A CLASS OF NONLINEAR RECURRENCE VECTOR SEQUENCES ⋮ On the power generator and its multivariate analogue ⋮ Predicting masked linear pseudorandom number generators over finite fields ⋮ Pseudorandom vector sequences of maximal period generated by triangular polynomial dynamical systems ⋮ Common composites of triangular polynomial systems and hash functions ⋮ Algebraic entropy, automorphisms and sparsity of algebraic dynamical systems and pseudorandom number generators ⋮ On pseudorandom numbers from multivariate polynomial systems ⋮ Computation of orders and cycle lengths of automorphisms of finite solvable groups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the generalized joint linear complexity profile of a class of nonlinear pseudorandom multisequences
- Sequences, discrepancies and applications
- The Laurent phenomenon
- Variation of periods modulo \(p\) in arithmetic dynamics
- Multivariate permutation polynomial systems and nonlinear pseudorandom number generators
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
- Expander graphs based on GRH with an application to elliptic curve cryptography
- Cryptographic hash functions from expander graphs
- A lower bound for the number of solutions of equations over finite fields
- Lattice reduction: a toolbox for the cryptoanalyst
- Heights of polynomials and entropy in algebraic dynamics
- On the order of finitely generated subgroups of \(\mathbb{Q}^*\pmod p\) and divisors of \(p-1\)
- On the distribution and lattice structure of nonlinear congruential pseudorandom numbers
- On some dynamical systems in finite fields and residue rings
- Exponential sums for nonlinear recurring sequences
- Exponential sum estimates over subgroups of \(\mathbb Z^*_q\), \(q\) arbitrary
- Exponential sum estimates in finite commutative rings and applications
- The density of prime divisors in the arithmetic dynamics of quadratic polynomials
- Attacking the Pollard Generator
- On the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators
- On a variant of sum-product estimates and explicit exponential sum bounds in prime fields
- Reconstructing Truncated Integer Variables Satisfying Linear Congruences
- How to predict congruential generators
- Quasi-Monte Carlo methods and pseudo-random numbers
- New bounds for Gauss sums derived from KTH powers, and for Heilbronn's exponential sum
- Predicting nonlinear pseudorandom number generators
- Intervals Contained in Arithmetic Combinations of Sets
- Cryptography and Coding
- ESTIMATES FOR THE NUMBER OF SUMS AND PRODUCTS AND FOR EXPONENTIAL SUMS IN FIELDS OF PRIME ORDER
- Information Security and Privacy
- On orthogonal systems and permutation polynomials in several variables
- Number of Points of Varieties in Finite Fields
This page was built for publication: Pseudorandom numbers and hash functions from iterations of multivariate polynomials
