Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Manuel Blum and Silvio Micali. How to generate cryptographically strong sequences of pseudorandom bits. SIAM J. Comput., 13(4):850–864, 1984.
Cristian Cobeli and Alexandru Zaharescu. An exponential congruence with solutions in primitive roots. Rev. Roumaine Math. Pures Appl., 44(1):15–22, 1999.
Rosario Gennaro. An improved pseudo-random generator based on discrete log. In M. Bellare, editor, Advances in Cryptology — CRYPTO 2000, pages 469–481. Springer, 2000.
Richard K. Guy. Unsolved Problems in Number Theory. Springer-Verlag, 1981.
Sarvar Patel and Ganapathy S. Sundaram. An efficient discrete log pseudo-random generator. In H. Krawczyk, editor, Advances in Cryptology — CRYPTO’ 98, pages 304–317. Springer, 1998.
Carl Pomerance. On fixed points for discrete logarithms. Talk given at the Central Section meeting of the AMS, Columbus, OH, September 22, 2001. Joint work with Mariana Campbell.
Wen Peng Zhang. On a problem of Brizolis. Pure Appl. Math., 11(suppl.):1–3, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/3-540-45455-1_32
Download citation
DOI: https://doi.org/10.1007/3-540-45455-1_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43863-2
Online ISBN: 978-3-540-45455-7
eBook Packages: Springer Book Archive