Finding ECM-friendly curves through a study of Galois properties

zbMATH Open1344.11043arXiv1202.4285MaRDI QIDQ2949486FDOQ2949486

Authors: Razvan Barbulescu, Joppe W. Bos, Cyril Bouvier, Thorsten Kleinjung, Peter L. Montgomery 

Publication date: 1 October 2015

Abstract: In this paper we prove some divisibility properties of the cardinality of elliptic curves modulo primes. These proofs explain the good behavior of certain parameters when using Montgomery or Edwards curves in the setting of the elliptic curve method (ECM) for integer factorization. The ideas of the proofs help us to find new families of elliptic curves with good division properties which increase the success probability of ECM.

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

Recommendations

• ECM using Edwards curves
• Starfish on strike
• Finding Suitable Curves for the Elliptic Curve Method of Factorization
• Factoring integers with elliptic curves
• Parametrizations for families of ECM-friendly curves

zbMATH Keywords

Galois groupsEdwards curvesMontgomery curveselliptic curve method (ECM)torsion properties

Mathematics Subject Classification ID

Elliptic curves over global fields (11G05) Complex multiplication and moduli of abelian varieties (11G15) Factorization (11Y05)

Cited In (4)

• Parametrizations for families of ECM-friendly curves
• Modular curves over number fields and ECM
• A classification of ECM-friendly families of elliptic curves using modular curves
• Faster cofactorization with ECM using mixed representations

Uses Software

• GMP-ECM

This page was built for publication: Finding ECM-friendly curves through a study of Galois properties

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