mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Operation Kibibit

Reply
 
Thread Tools
Old 2014-09-05, 16:39   #1
jasonp
Tribal Bullet
 
jasonp's Avatar
 
Oct 2004

3·1,163 Posts
Default Improved NFS polynomial selection

Paper by Paul Zimmermann just posted here.

They used the dataset for RSA768 that we generated here in 2011, plus some new quite clever techniques, to find a polynomial that sieves 5-7% faster than the one actually used for RSA768. If you helped with that, you may find yourself in the acknowledgements :)

Optimized results are also included for RSA896 using the huge dataset computed here together with the CADO group, plus some preliminary results for RSA1024.

Last fiddled with by jasonp on 2014-09-05 at 16:49
jasonp is offline   Reply With Quote
Old 2014-09-05, 17:34   #2
xilman
Bamboozled!
 
xilman's Avatar
 
"π’‰Ίπ’ŒŒπ’‡·π’†·π’€­"
May 2003
Down not across

34×53 Posts
Default

Quote:
Originally Posted by jasonp View Post
Paper by Paul Zimmermann just posted here.
Thanks. Downloaded a copy and printed fo bed-time reading tonight.
xilman is offline   Reply With Quote
Old 2014-09-05, 17:59   #3
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

104528 Posts
Default

Jason-
You've said for a long time that sextic searches are dramatically more difficult to optimize, and that some advance in algorithm was needed. This looks like just what you wished for two years ago!

Are you considering coming out of retirement to code this into msieve?

Thanks for the reference; the paper is quite readable for us mere enthusiasts!
VBCurtis is online now   Reply With Quote
Old 2014-09-06, 01:51   #4
jwaltos
 
jwaltos's Avatar
 
Apr 2012

22·3·29 Posts
Default

Thank you for the link to a very interesting paper.
I have been developing a form of integer factorization over general conics. Hillgarter's 1996 paper provides an algorithm in Maple 5 which unfortunately only creates trivial factorizations using the method I am experimenting with. The following is as far as I have gotten factoring an integer that can be used to factor RSA - 1536. I'm providing the polynomial I obtained with GGNFS.
I will see what CADO 2.1 can do in terms of providing a better polynomial faster.
Attached Files
File Type: txt ex298.txt (745 Bytes, 184 views)

Last fiddled with by jwaltos on 2014-09-06 at 02:48
jwaltos is offline   Reply With Quote
Old 2014-09-07, 10:51   #5
ET_
Banned
 
ET_'s Avatar
 
"Luigi"
Aug 2002
Team Italia

476810 Posts
Default

Quote:
Originally Posted by jasonp View Post
Paper by Paul Zimmermann just posted here.

They used the dataset for RSA768 that we generated here in 2011, plus some new quite clever techniques, to find a polynomial that sieves 5-7% faster than the one actually used for RSA768. If you helped with that, you may find yourself in the acknowledgements :)

Optimized results are also included for RSA896 using the huge dataset computed here together with the CADO group, plus some preliminary results for RSA1024.
I'm there!

Luigi
ET_ is offline   Reply With Quote
Old 2014-09-07, 11:02   #6
xilman
Bamboozled!
 
xilman's Avatar
 
"π’‰Ίπ’ŒŒπ’‡·π’†·π’€­"
May 2003
Down not across

34·53 Posts
Default

Quote:
Originally Posted by ET_ View Post
I'm there!

Luigi
[aol]Me too !!??!!!! [/aol]
xilman is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Polynomial selection Max0526 NFS@Home 9 2017-05-20 08:57
Updated polynomial selection jasonp Msieve 65 2011-05-01 19:06
GNFS polynomial selection Unregistered Information & Answers 3 2011-04-16 14:24
2^877-1 polynomial selection fivemack Factoring 47 2009-06-16 00:24
Polynomial selection CRGreathouse Factoring 2 2009-05-25 07:55

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

Tue Oct 27 03:40:27 UTC 2020 up 47 days, 51 mins, 0 users, load averages: 1.58, 1.83, 1.86

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.