Some heuristics and results for small cycles of the discrete logarithm
From MaRDI portal
Publication:5713238
DOI10.1090/S0025-5718-05-01768-0zbMath1116.11004arXivmath/0401013MaRDI QIDQ5713238
Pieter Moree, Joshua Brandon Holden
Publication date: 12 December 2005
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0401013
Asymptotic results on arithmetic functions (11N37) Cryptography (94A60) Congruences; primitive roots; residue systems (11A07) Software, source code, etc. for problems pertaining to number theory (11-04)
Related Items (8)
Statistics for fixed points of the self-power map ⋮ Power map permutations and the discrete log problem ⋮ Fixed points of the subset sum pseudorandom number generators ⋮ On the action of permutations on distances between values of rational functions mod \(p\) ⋮ COUNTING FIXED POINTS, TWO-CYCLES, AND COLLISIONS OF THE DISCRETE EXPONENTIAL FUNCTION USING p-ADIC METHODS ⋮ Short cycles in repeated exponentiation modulo a prime ⋮ The congruence $x^{x}\equiv \lambda \pmod p$ ⋮ Counting fixed points and rooted closed walks of the singular map \(x \mapsto x^{x^n}\) modulo powers of a prime
Cites Work
- Théorème de Brun-Titchmarsh; application au théorème de Fermat
- Prime divisors of second order linear recurrences. II
- Asymptotically exact heuristic for (near) primitive roots.
- Prime divisors of the Lagarias sequence
- Approximation of singular series and automata
- An average result for Artin's conjecture
- Unsolved problems in number theory
- A two-variable Artin conjecture
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Some heuristics and results for small cycles of the discrete logarithm