Short cycles in repeated exponentiation modulo a prime

DOI10.1007/s10623-009-9339-2zbMath1213.11198arXiv0908.3920OpenAlexW2082462116MaRDI QIDQ977189

Igor E. Shparlinski, L. Yu. Glebskiĭ

Publication date: 21 June 2010

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0908.3920

zbMATH Keywords

cycledynamical systemdiscrete logarithm

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Congruences; primitive roots; residue systems (11A07)

Related Items (3)

On the Fixed Points of an Elliptic-Curve Version of Self-Power Map ⋮ COUNTING FIXED POINTS, TWO-CYCLES, AND COLLISIONS OF THE DISCRETE EXPONENTIAL FUNCTION USING p-ADIC METHODS ⋮ Soficity, short cycles, and the Higman group

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the security of modular exponentiation with application to the construction of pseudorandom generators
• On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
• Interpolation of the Double Discrete Logarithm
• Product Sets of Rationals, Multiplicative Translates of Subgroups in Residue Rings, and Fixed Points of the Discrete Logarithm
• Intervals Contained in Arithmetic Combinations of Sets
• Some heuristics and results for small cycles of the discrete logarithm

This page was built for publication: Short cycles in repeated exponentiation modulo a prime