On the iteration of certain quadratic maps over GF(p)

@article{Vasiga2004OnTI,
  title={On the iteration of certain quadratic maps over GF(p)},
  author={Troy Vasiga and J. Shallit},
  journal={Discret. Math.},
  year={2004},
  volume={277},
  pages={219-240}
}
We consider the properties of certain graphs based on iteration of the quadratic maps x->x^2 and x->x^2-2 over a finite field GF(p). 
Graphs associated with the map x↦ x+ x- 1 in finite fields of characteristic two
In this paper we study the structure of the graphs associated with the iterations of the map x 7→ x + x over finite fields of characteristic two. Formulas are given for the length of the cycles andExpand
Iterations of Integer Polynomial Maps Modulo Primes
In this elementary note we discuss some questions related to the behavior of iterations of polynomial maps with integer coefficients moduloprimes. In particular, we introduce three examples of suchExpand
Functional graphs of rational maps induced by endomorphisms of ordinary elliptic curves over finite fields
  • S. Ugolini
  • Mathematics, Computer Science
  • Period. Math. Hung.
  • 2018
TLDR
For any rational maps induced by endomorphisms of ordinary elliptic curves defined over finite fields, the cycle and the tree structures of the associated graphs are described. Expand
Symmetry of iteration graphs
We examine iteration graphs of the squaring function on the rings ℤ/nℤ when n = 2kp, for p a Fermat prime. We describe several invariants associated to these graphs and use them to prove that theExpand
Modelling the Number of Periodic Points of Quadratic Maps Using Random Maps
Since the introduction of Pollard's rho method for integer factorisation in 1975 there has been great interest in understanding the dynamics of quadratic maps over finite fields. One avenue for thiExpand
On the iterations of certain maps X↦K⋅(X+X−1) over finite fields of odd characteristic
Abstract Text In this paper we describe the dynamics of certain rational maps of the form k ⋅ ( x + x − 1 ) over finite fields of odd characteristic. This work extends our previous investigations onExpand
GRAPH COMPONENTS AND DYNAMICS OVER FINITE FIELDS
For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of components of their functional graphs as well as the average number of periodic points ofExpand
An Analysis of Digraphs and Period Properties of the Logistic Map on Z(pn)
  • Yongkui Li
  • Mathematics, Computer Science
  • Int. J. Pattern Recognit. Artif. Intell.
  • 2019
This paper corrects some mistakes about three theorems, two figures and some expressions on “finite field” in a literature, and then it analyzes the digraphs and period properties of the logistic m...
On the Cycle Structure of Repeated Exponentiation Modulo a Prime Power
We obtain some results about the repeated exponentiation modulo a prime power from the viewpoint of arithmetic dynamical systems. Especially, we extend two asymptotic formulas about periodic pointsExpand
Geometrically nilpotent subvarieties
  • A. Borisov
  • Mathematics, Computer Science
  • Finite Fields Their Appl.
  • 2018
We construct some examples of polynomial maps over finite fields that admit subvarieties with a peculiar property: every geometric point is mapped to a fixed point by some iteration of the map, whileExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 27 REFERENCES
Maximal Periods of x + c in Fq
The orbits produced by the iterations of the mapping x ? x2 + c, defined over Fq, are studied. Several upper bounds for their periods are obtained, depending on the coefficient c and the number ofExpand
On the Number of Cycles of p-adic Dynamical Systems
We found the asymptotics, p→∞, for the number of cycles for iteration of monomial functions in the fields of p-adic numbers. This asymptotics is closely connected with classical results on theExpand
The graph of the square mapping on the prime fields
TLDR
The number of components c ( p ) (called the connectivity of the prime p ) is shown to take on certain values, assuming various hypotheses, and a formula is given for the decomposition of the graph into cyclic components and their attached trees. Expand
Greatest of the least primes in arithmetic progressions having a given modulus
We give a heuristic argument, supported by numerical evidence, which suggests that the maximum, taken over the reduced residue classes modulo k, of the least prime in the class, is usually about 0(k)Expand
Combinatorial cycles of a polynomial map over a commutative field
  • G. Chassé
  • Computer Science, Mathematics
  • Discret. Math.
  • 1986
TLDR
If the degree of f as a polynomial is greater than 1, then the cycle length of f, extended to an algebraic closure K of K is not bounded, which means that for each positive integer N, one can find an integer n such that there exist n different elements of K. Expand
Function digraphs of quadratic maps modulo p
In this paper we will consider geometric representations of the iteration of quadratic polynomials modulo p. This is a discrete analogue of the classical quadratic Julia sets which have been theExpand
A Note on Shanks's Chains of Primes
TLDR
Certain properties of functional digraphs of quadratic functions over prime fields of length k are studied, both in theory and practice, and efficient algorithms to investigate these properties are given. Expand
Analysis of Iterated Modular Exponentiation: The Orbits of xα mod N
TLDR
If N is a bicomposite RSA modulus, the analysis shows how to quantify the risk posed by an iterated encryption attack using the prime generation algorithm defined in Maurer maur. Expand
GEOMETRY OF NUMERIC ITERATIONS
ABSTRACT Simple numeric iterations can be represented by interesting geometrical patterns. Iterating different functions such as x → x 2(modp), and x → 2x(modp − 1) surprisingly generate essentiallyExpand
A Simple Unpredictable Pseudo-Random Number Generator
TLDR
Two closely-related pseudo-random sequence generators are presented: the ${1 / P} generator, with input P a prime, and the $x^2 \bmod N$generator, which outputs the quotient digits obtained on dividing 1 by P. Expand
...
1
2
3
...