Primality proving via one round in ECPP and one iteration in AKS

DOI10.1007/s00145-006-0406-9zbMath1155.11362arXivmath/0301179OpenAlexW2028911737MaRDI QIDQ2642254

Qi Cheng

Publication date: 20 August 2007

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0301179

zbMATH Keywords

Algorithm analysisComputational number theoryAgrawal-Kayal-Saxena primality-testing algorithmElliptic curve primality provingPrimality testing

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Primality (11Y11)

Related Items (3)

Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields ⋮ Elliptic periods and primality proving ⋮ Randomized polynomial-time root counting in prime power rings

This page was built for publication: Primality proving via one round in ECPP and one iteration in AKS