Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm
From MaRDI portal
Publication:2958977
DOI10.1145/1145768.1145791zbMath1356.11091OpenAlexW2014206951MaRDI QIDQ2958977
Pierrick Gaudry, François Morain
Publication date: 3 February 2017
Published in: Proceedings of the 2006 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1145768.1145791
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)
Related Items (2)
On the distribution of Atkin and Elkies primes ⋮ Computing cardinalities of -curve reductions over finite fields
This page was built for publication: Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm