The counting function for Elkies primes

DOI10.1016/J.JNT.2024.12.009MaRDI QIDQ6998679zbMATH OpenFDO

Authors Meher Elijah Lippmann, Kevin J. McGown

Publication date 11 April 2025

Published in Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JNT.2024.12.009

zbMATH Keywords

character sumselkies primeselliptic curvesSEA algorithm

Mathematics Subject Classification ID

Curves over finite and local fields (11G20) Distribution of primes (11N05) Number-theoretic algorithms; complexity (11Y16)

Cites work

• Comments on search procedures for primitive roots
• Conditional bounds for the least quadratic non-residue and related problems
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Estimation de la fonction de Tchebychef θ sur le k-ième nombre premier et grandes valeurs de la fonction ω(n) nombre de diviseurs premiers de n
• Explicit Bounds for Primality Testing and Related Problems
• Explicit estimates of some functions over primes
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• scientific article; zbMATH DE number 3912454 (Why is no real title available?)
• scientific article; zbMATH DE number 47601 (Why is no real title available?)
• scientific article; zbMATH DE number 1210367 (Why is no real title available?)
• scientific article; zbMATH DE number 1542664 (Why is no real title available?)
• scientific article; zbMATH DE number 2086874 (Why is no real title available?)
• On the distribution of Atkin and Elkies primes
• Problems in analytic number theory

This page was built for publication: The counting function for Elkies primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6998679)