On the discrete logarithm problem
Cristian Cobeli

TL;DR
This paper discusses the distribution of discrete logarithms of numbers in arithmetic progressions modulo a prime, suggesting they are uniformly distributed and raising related questions.
Contribution
It provides an argument supporting the uniform distribution of discrete logarithms in arithmetic progressions and explores implications and open questions.
Findings
Discrete logarithms in arithmetic progressions are uniformly distributed.
Raises questions about the distribution properties of discrete logs.
Provides an argument supporting uniformity hypothesis.
Abstract
Let be prime and a primitive root modulo . We present an argument for the fact that discrete logarithms of the numbers in any arithmetic progression are uniformly distributed in and raise some questions on the subject.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Coding theory and cryptography · Cryptography and Residue Arithmetic
