The Open Book Series · 2013 · 12 citations · 8 references
Natural SciencesComputer ScienceMathematicsCombinatoricsCryptographyGeometryAlgebraic Number TheoryArithmetic GeometryCombinatorial Number TheoryElliptic CurvesGalois TheoryDivisibility ProofsElliptic Curve ArithmeticElliptic Curve FamiliesElliptic Curve GroupsInfinite DivisibilityInteger FactorizationMontgomery Curves
We prove some divisibility properties of the cardinality of elliptic curve groups 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 behind the proofs help us to find new infinite families of elliptic curves with good division properties increasing the success probability of ECM.
8
Factoring Integers with Elliptic Curves
H. W. Lenstra · Annals of Mathematics · 1987 · 1K citations
Daniel J. Bernstein, Peter Birkner, Marc Jóye et al. · TU/e Research Portal (Eindhoven University of Technology) · 2008 · 152 citations · Full text
Serre's uniformity problem in the split Cartan case
Yuri Bilu, Pierre Parent · Annals of Mathematics · 2011 · 63 citations · Full text