Distribution of the error in estimated numbers of fixed points of the discrete logarithm

Authors:
Joshua Holden
Affiliations:
Rose-Hulman Institute of Technology, Terre Haute, IN
Venue:
ACM SIGSAM Bulletin
Year:
2004

Citing 2
Cited 0

How to generate cryptographically strong sequences of pseudo-random bits

SIAM Journal on Computing
An Efficient Discrete Log Pseudo Random Generator

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Brizolis asked the question: does every prime p have a pair (g, h) such that h is a fixed point for the discrete logarithm with base g? This author and Pieter Moree, building on work of Zhang, Cobeli, and Zaharescu, gave heuristics for estimating the number of such pairs and proved bounds on the error in the estimates. These bounds are not descriptive of the true situation, however, and this paper is a first attempt to collect and analyze some data on the distribution of the actual error in the estimates.