Fixed Points and Two-Cycles of the Discrete Logarithm

  • Joshua Holden
Conference paper

DOI: 10.1007/3-540-45455-1_32

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2369)
Cite this paper as:
Holden J. (2002) Fixed Points and Two-Cycles of the Discrete Logarithm. In: Fieker C., Kohel D.R. (eds) Algorithmic Number Theory. ANTS 2002. Lecture Notes in Computer Science, vol 2369. Springer, Berlin, Heidelberg


We explore some questions related to one of Brizolis: does every prime p have a pair (g, h) such that h is a fixed point for the discrete logarithm with base g? We extend this question to ask about not only fixed points but also two-cycles. Campbell and Pomerance have not only answered the fixed point question for sufficiently large p but have also rigorously estimated the number of such pairs given certain conditions on g and h. We attempt to give heuristics for similar estimates given other conditions on g and h and also in the case of two-cycles. These heuristics are well-supported by the data we have collected, and seem suitable for conversion into rigorous estimates in the future.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Joshua Holden
    • 1
  1. 1.Department of MathematicsRose-Hulman Institute of TechnologyTerre HauteUSA

Personalised recommendations