Iteration entropy
From MaRDI portal
Publication:4629386
DOI10.1090/mcom/3382zbMath1460.11107arXiv1712.01407OpenAlexW3037444573MaRDI QIDQ4629386
Publication date: 22 March 2019
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.01407
Randomized algorithms (68W20) Pseudo-random numbers; Monte Carlo methods (11K45) Arithmetic and non-Archimedean dynamical systems involving polynomial and rational maps (37P05) Dynamical systems over finite ground fields (37P25)
Cites Work
- Unnamed Item
- Unnamed Item
- Functional graphs of polynomials over finite fields
- The cycle structure of random permutations
- On the iteration of certain quadratic maps over GF(\(p\)).
- On the cycle structure of repeated exponentiation modulo a prime
- Practical chosen ciphertext secure encryption from factoring
- A probabilistic heuristic for counting components of functional graphs of polynomials over finite fields
- Dynamically distinguishing polynomials
- Period of the power generator and small values of Carmichael’s function
- Counting dynamical systems over finite fields
- On the heuristic of approximating polynomials over finite fields by random mappings
- Monomial dynamical systems of dimension one over finite fields
- On the Cycle Structure of Repeated Exponentiation Modulo a Prime Power
- A Simple Unpredictable Pseudo-Random Number Generator
- Inferring sequences produced by pseudo-random number generators
- On random polynomials over finite fields
- Periods of Iterations of Functions with Restricted Preimage Sizes
- On Functional Graphs of Quadratic Polynomials
- Periods of iterated rational functions
- On the periods of the linear congruential and power generators
- Connected components of the graph generated by power maps in prime finite fields
- GRAPH COMPONENTS AND DYNAMICS OVER FINITE FIELDS
- Ordered Cycle Lengths in a Random Permutation
