JKL-ECM: ECM using Hessian curves

CRGreathouse · 2017-08-27, 22:12

Code and slides were recently posted here:
http://www.math.ie/jkl/jklecm.html

Any thoughts? It's not competitive -- "we do not outperform GMP-ECM in terms of speed. (Although it is close, and the gap narrows with larger inputs)." -- but that's without assembly or apparently that much optimization so it does look interesting. It describes itself as a sort of moral successor to EECM-MPFQ (ECM using Edwards Curves).

chris2be8 · 2017-09-06, 15:39

Two thoughts:

The PDF has stats on pages 21 and 22 for finding primes that are 1 mod 3. Does that mean it can't find primes that are 2 mod 3?

The README says in part

Quote:

If you are factoring numbers of the form

a^(2*x) + b^(2*y)

then try JKL-ECM with Edwards curves. The group order #E(F_p) will have a
prescribed factor of at least 16, and possibly 32.

That would apply to X^Y+Y^X where X and Y are both even.

Chris

2017-08-27, 22:12	#1
CRGreathouse Aug 2006 13533₈ Posts	JKL-ECM: ECM using Hessian curves Code and slides were recently posted here: http://www.math.ie/jkl/jklecm.html Any thoughts? It's not competitive -- "we do not outperform GMP-ECM in terms of speed. (Although it is close, and the gap narrows with larger inputs)." -- but that's without assembly or apparently that much optimization so it does look interesting. It describes itself as a sort of moral successor to EECM-MPFQ (ECM using Edwards Curves).

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
ECM - why 3 curves?	James Heinrich	PrimeNet	3	2017-11-14 13:59
B1 and # curves for ECM	Walter Nissen	Factoring	36	2014-02-16 00:20
Need help with elliptic curves...	WraithX	Math	12	2010-09-29 09:34
Curves needed	henryzz	GMP-ECM	3	2007-12-21 16:13
Elliptic curves in NFS	otkachalka	Factoring	5	2005-11-20 12:22