2000 character limit reached
Finding ECM-friendly curves through a study of Galois properties (1202.4285v2)
Published 20 Feb 2012 in math.NT and cs.CR
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.