20170827, 22:12  #1 
Aug 2006
1011100101100_{2} Posts 
JKLECM: 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 GMPECM 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 EECMMPFQ (ECM using Edwards Curves). 
20170906, 15:39  #2  
Sep 2009
5·383 Posts 
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:
Chris 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
ECM  why 3 curves?  James Heinrich  PrimeNet  3  20171114 13:59 
B1 and # curves for ECM  Walter Nissen  Factoring  36  20140216 00:20 
Need help with elliptic curves...  WraithX  Math  12  20100929 09:34 
Curves needed  henryzz  GMPECM  3  20071221 16:13 
Elliptic curves in NFS  otkachalka  Factoring  5  20051120 12:22 