2024/08/29 by Sung‐Min Lee, Lee, Sung Min, Jacob Mayle +3
Computer Science · Mathematics · #Cryptography and Residue Arithmetic #FOS: Mathematics #Mathematical Approximation and Integration #Number Theory (math.NT) #Primary 11G05 #Secondary 11F80
paper · pdf · doi:10.48550/arxiv.2408.16641
openalex publication_date 2024/08/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The cyclicity and Koblitz conjectures ask about the distribution of primes of cyclic and prime-order reduction, respectively, for elliptic curves over ℚ. In 1976, Serre gave a conditional proof of the cyclicity conjecture, but the Koblitz conjecture (refined by Zywina in 2011) remains open. The conjectures are now known unconditionally "on average" due to work of Banks--Shparlinski and Balog--Cojocaru--David. Recently, there has been a growing interest in the cyclicity conjecture for primes in arithmetic progressions (AP), with relevant work by Akbal--Güloğlu and Wong. In this paper, we adapt Zywina's method to formulate the Koblitz conjecture for primes in AP and refine a theorem of Jones to establish results on the moments of the constants in both the cyclicity and Koblitz conjectures for AP. In doing so, we uncover a somewhat counterintuitive phenomenon: On average, these two constants are oppositely biased over congruence classes. Finally, in an accompanying repository, we give Magma code for computing the constants discussed in this paper.