Algorithmic Number Theory

DOI10.1007/b98210zbMath1125.11359OpenAlexW2791103999WikidataQ29036695 ScholiaQ29036695MaRDI QIDQ5465620

No author found.

Publication date: 12 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98210

zbMATH Keywords

fast Fourier transformelliptic curve primality proving algorithmroots of Hilbert polynomials modulo primes

Mathematics Subject Classification ID

Primality (11Y11)

Related Items (3)

Computation of a 768-Bit Prime Field Discrete Logarithm ⋮ A $p$-adic algorithm to compute the Hilbert class polynomial ⋮ Implementing the asymptotically fast version of the elliptic curve primality proving algorithm

Uses Software

• FFTW

This page was built for publication: Algorithmic Number Theory