Algorithmic Number Theory

DOI10.1007/B98210zbMATH Open1125.11359OpenAlexW2791103999MaRDI QIDQ5465620FDOQ5465620

Authors:

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

Recommendations

• Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
• scientific article; zbMATH DE number 65932
• Deterministic elliptic curve primality proving for a special sequence of numbers
• Primality proofs with elliptic curves: heuristics and analysis
• scientific article; zbMATH DE number 177027

zbMATH Keywords

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

Mathematics Subject Classification ID

Primality (11Y11)

Cited In (11)

• Fast Primality Tests for Numbers Less Than 50 ⋅10 9
• Title not available (Why is that?)
• Title not available (Why is that?)
• Primality proving via one round in ECPP and one iteration in AKS
• FastECPP over MPI
• Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
• A $p$-adic algorithm to compute the Hilbert class polynomial
• Primality proofs with elliptic curves: heuristics and analysis
• Computation of a 768-bit prime field discrete logarithm
• Deterministic elliptic curve primality proving for a special sequence of numbers
• Title not available (Why is that?)

Uses Software

• FFTW

This page was built for publication: Algorithmic Number Theory

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