mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Software

Reply
 
Thread Tools
Old 2017-08-27, 22:12   #1
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

10111001011002 Posts
Default 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).
CRGreathouse is offline   Reply With Quote
Old 2017-09-06, 15:39   #2
chris2be8
 
chris2be8's Avatar
 
Sep 2009

5·383 Posts
Default

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
chris2be8 is offline   Reply With Quote
Reply

Thread Tools


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

All times are UTC. The time now is 23:07.

Wed Oct 28 23:07:23 UTC 2020 up 48 days, 20:18, 1 user, load averages: 1.35, 1.47, 1.66

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.