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

Discrete Mathematics

Volumn 277, Issue 1-3, 2004, Pages 219-240

  Vasiga, Troy ^a   Shallit, Jeffrey ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Discrete iteration; Fermat prime; Finite field; Functional digraph; Mersenne prime; Quadratic map

Indexed keywords

ALGORITHMS; CONFORMAL MAPPING; GRAPH THEORY; HEURISTIC METHODS; NUMBER THEORY; SET THEORY;

DISCRETE ITERATION; FERMAT PRIME NUMBERS; FUNCTIONAL DIGRAPHS; MERSENNE PRIME NUMBERS; QUADRATIC MAPS;

ITERATIVE METHODS;

EID: 0742302979     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(03)00158-4     Document Type: Article

References (26)

1. Bach E., Shallit J. Algorithmic Number Theory. 1996;MIT Press, Cambridge, MA.
2. Blanton E.L. Jr., Hurd S.P., McCranie J.S. On the digraph defined by squaring. mod m, when m has primitive roots Congr. Numer. 82:1991;167-177.
3. Blanton E.L. Jr., Hurd S.P., McCranie J.S. On a digraph defined by squaring modulo. n Fibonacci Quart. 30:1992;322-333.
4. Blum L., Blum M., Shub M. A simple unpredictable pseudo-random number generator. SIAM J. Comput. 15:1986;364-381.
5. α mod N Designs, Codes Cryptogr. 13:1998;229-245.
6. A.Z. Broder, Weighted random mappings; properties and applications, Ph.D. Thesis, Department of Computer Science, Stanford University, May 1985. Technical Report STAN-CS-85-1054.
7. G. Chassé, Applications d'un corps fini dans lui-même, Vol. 149. Université de Rennes I U.E.R. de Mathématiques et Informatique, Rennes, 1984. Dissertation, Université de Rennes I, Rennes, 1984.
8. G. Chassé, Applications d'un corps fini dans lui-même, in: Algebra Colloquium Rennes, 1985, Université de Rennes I, Rennes, 1985, pp. 207-219.
9. Chassé G. Combinatorial cycles of a polynomial map over a commutative field. Discrete Math. 61:1986;21-26.
10. Flores A. Geometry of numeric iterations. PRIMUS. 4(1):1994;29-38.
11. Gilbert C.L., Kolesar J.D., Reiter C.A., Storey J.D. Function digraphs of quadratic maps modulo. p Fibonacci Quart. 39:2001;32-49.
12. Harris B. Probability distributions related to random mappings. Ann. Math. Statist. 31:1960;1045-1062.
13. Khrennikov A., Nilsson M. On the number of cycles of. p -adic dynamical systems J. Number Theory. 90:2001;255-264.
14. Lehmer D.H. An extended theory of Lucas' functions. Ann. Math. 31:1930;419-448.
15. Lewis H.R., Denenberg L. Data Structures & Their Algorithms. 1991;HarperCollins, New York.
16. Lucas E. Théorie des fonctions numériques simplement périodiques. Amer. J. Math. 1:1878;184-240, 289-321.
17. Lucheta C., Miller E., Reiter C. Digraphs from powers modulo. p Fibonacci Quart. 34:1996;226-239.
18. G.L. Mullen R. Lidl, G. Turnwald, Dickson Polynomials, Pitman Monographs and Surveys in Pure and Applied Mathematics, Vol. 65, Longman Scientific, Essex, England, 1993.
19. Nöbauer W. Über die Fixpunte der Dickson-Permutationen. Österreich. Akad. Wiss. Math.-Natur. Kl. Sitzungsber. II. 193:1984;115-133.
20. q, in: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Melbourne, 2001, Lecture Notes in Computer Science, Vol. 2227, Springer, Berlin, 2001, pp. 219-228.
21. 2n+1 C. R. Acad. Sci. Paris. 85:1877;329-331.
22. Pollard J.M. A Monte Carlo method for factorization. BIT. 15:1975;331-334.
23. Rogers T.D. The graph of the square mapping on the prime fields. Discrete Math. 148:1996;317-324.
24. Teske E., Williams H.C. A note on Shanks' chains of primes. Bosma W. Proceedings of ANTS IV. Lecture Notes in Computer Science. Vol. 1838:2000;563-580 Springer, Berlin.
25. Wagstaff S.S. Jr. Greatest of the least primes in arithmetic progressions having a given modulus. Math. Comput. 33:1979;1073-1080.
26. Wilson B. Power digraphs modulo. n Fibonacci Quart. 36:1998;229-239.