mersenneforum.org 100 Most Wanted
 Register FAQ Search Today's Posts Mark Forums Read

 2003-12-03, 15:58 #1 Citrix     Jun 2003 30538 Posts 100 Most Wanted I am interested in developing new factoring methods. In order to try these methods out I am looking for 100 candidates with different sizes having different size factors. If any one has any suggestions or has some candidates please post the numbers below. The problem working with some of the numbers that everyone is trying to factor is that they are hard to factor and an undeveloped method has little chance to factor them and hence we canโt figure out the power of the new factoring algorithm. Citrix
2003-12-03, 16:23   #2
xilman
Bamboozled!

"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across

244208 Posts
Re: 100 Most Wanted

Quote:
 Originally posted by Citrix I am interested in developing new factoring methods. In order to try these methods out I am looking for 100 candidates with different sizes having different size factors. If any one has any suggestions or has some candidates please post the numbers below. The problem working with some of the numbers that everyone is trying to factor is that they are hard to factor and an undeveloped method has little chance to factor them and hence we canโt figure out the power of the new factoring algorithm. Citrix
I suggest that you first develop your algorithms on integers for which you already know the factors --- because in this way you can create targets which have exactly known properties.

When you have something that seems to work on numbers of a particular size, then work on numbers of a similar size with unknown factorizations.

If you don't want to practice beforehand, there are any number of
tables of integers to be found. My web site at http://research.microsoft.com/~pleyl...ation/main.htm and links therein contains many thousands of such numbers.

Paul

 2003-12-03, 16:43 #3 wblipp     "William" May 2003 New Haven 23·5·59 Posts It's going to be hard to find numbers that people think of as "most wanted" but that haven't already had substantial attempts using ECM and perhaps P-1 and P+1. If suitable, I'd be glad to provide composite numbers from ElevenSmooth. The ECM Server for the ElevenSmooth project has 63 active composites. These range in size from 149 digits to 6936 digits. The C149 is presently testing for 50 digit factors (B1=43M). There are 22 numbers presently testing for 40 digit factors (B1=3M), ranging from 186 to 443 digits. The numbers between 490 and 1357 digits are being tested for 35 digit factors, the larger numbers are being tested for 30 digit factors. There are also about 100 composites that are presently being tested for 25 digit factors by the Special Project. The smallest of these are probably in the low 200 digits. I count the C149 as my "most wanted," but would be pleased to have factors for any of these. If any these meet your requirements, I'd be glad to provide the composites.
 2003-12-03, 17:07 #4 Citrix     Jun 2003 1,579 Posts I could use these as a start and update the list as more people submit numbers. Post about 100 numbers below or PM them to me. Thanks, Citrix
2003-12-04, 16:33   #5
wblipp

"William"
May 2003
New Haven

1001001110002 Posts

Quote:
 Originally posted by Citrix Post about 100 numbers below
The ElevenSmooth FAQ now answers What composites are being distributed by the ECM Server? with a link to a text file containing the 63 composites.

 2003-12-12, 04:21 #6 dsouza123     Sep 2002 10100101102 Posts 31074182404900437213507500358885679300373460228427 27545720161948823206440518081504556346829671723286 78243791627283803341547107310850191954852900733772 4822783525742386454014691736602477652346609 RSA 640 You could verify your factoring method works using the recently factored RSA 576 18819881292060796383869723946165043980716356337941 73827007633564229888597152346654853190606065047430 45317388011303396716199692321205734031879550656996 221305168759307650257059
2003-12-12, 06:56   #7
tom11784

Aug 2003
Upstate NY, USA

2×163 Posts

Quote:
 Originally posted by dsouza123 You could verify your factoring method works using the recently factored RSA 576 18819881292060796383869723946165043980716356337941 73827007633564229888597152346654853190606065047430 45317388011303396716199692321205734031879550656996 221305168759307650257059
Recently factored? Their website http://www.rsasecurity.com/rsalabs/c...rs.html#RSA576 still have it as not factored.

2003-12-12, 14:32   #8
smh

"Sander"
Oct 2002
52.345322,5.52471

22458 Posts

Quote:
 Recently factored? Their website http://www.rsasecurity.com/rsalabs/...ers.html#RSA576 still have it as not factored.
That shows how recentely it was

2003-12-12, 14:53   #9
TauCeti

Mar 2003
Braunschweig, Germany

2×113 Posts

Quote:
 Originally posted by tom11784 Recently factored? Their website http://www.rsasecurity.com/rsalabs/c...rs.html#RSA576 still have it as not factored.
Well, it was factored involving germany. Maybe 'old europe' countries are no longer allowed to factor and the results are ignored?

Maybe US researchers even have to look for different factors of RSA-576 to abide the law?

 2004-01-12, 02:16 #10 Citrix     Jun 2003 1,579 Posts I am looking for all the factors of mersenne numbers under 2^256-1. that is 2^n-1, n from 1 to 256 Could you please provide me with a website where I can download these numbers. Thanks, Citrix
 2004-01-12, 03:12 #11 nfortino     Nov 2003 3×5×11 Posts Although you have to write a program to reconstruct all factors for each number,The Cunningham Project Site should have everything you need. Last fiddled with by nfortino on 2004-01-12 at 03:12

 Similar Threads Thread Thread Starter Forum Replies Last Post rogue FermatSearch 33 2021-01-05 04:21 ET_ FermatSearch 12 2016-11-09 13:31 Prime95 Data 18 2012-02-12 18:07 kar_bon Riesel Prime Data Collecting (k*2^n-1) 15 2011-08-09 16:50 R.D. Silverman Cunningham Tables 1 2010-09-21 16:16

All times are UTC. The time now is 03:57.

Sun Jan 24 03:57:32 UTC 2021 up 52 days, 8 mins, 0 users, load averages: 2.17, 2.45, 2.40