NFS@Home: Difference between revisions
→Project team / Sponsors: update project team and result links |
→Why NFS@Home?: initial text |
||
| Line 1: | Line 1: | ||
[[File:{{#setmainimage:Nfs.jpg}}|alt=logo image|center|frameless]] | [[File:{{#setmainimage:Nfs.jpg}}|alt=logo image|center|frameless]] | ||
| Line 6: | Line 4: | ||
== Why NFS@Home? == | == Why NFS@Home? == | ||
Previous participation in volunteer computing and an interest in integer factorization, led to following the development of the [https://www.math.ttu.edu/~cmonico/software/ggnfs/ '''''GGNFS'''''] and msieve implementations of Number Field Sieve (NFS). [https://www.rieselprime.de/ziki/NFSNET NFSNet] had been developed for distribution of NFS sieving, but never caught on. Creating a BOINC project at this point was considered, but BOINC project [https://web.archive.org/web/20140913231024/http://boinc.unsads.com/rsals/ '''''RSA Lattice Siever'''''] had been launched to distribute the NFS sieving to factor the signing keys for TI calculators. | |||
Dr. Greg Childers contributed to RSA Lattice Siever behind the scenes and assisted with the linear algebra. Implementation details were shared in return, which was used to inform the development and [https://www.mersenneforum.org/showthread.php?t=12388 '''''launch of NFS@Home''''']. | |||
== Goal == | == Goal == | ||
Once the TI keys were done, the RSA Lattice Siever project continued with smaller numbers while NFS@Home focused on factoring larger numbers. After about three years, RSA Lattice Siever lost interest in continuing, so their work was merged into NFS@Home with the addition of queues for smaller factorizations. | |||
== Methods == | == Methods == | ||
Revision as of 18:17, 17 February 2024
[[File:{{#setmainimage:Nfs.jpg}}|alt=logo image|center|frameless]]
NFS@Home is a volunteer distributed computing project that needs your help to push the boundaries of integer factorization by performing the lattice sieving step in the Number Field Sieve factorization of large integers.
Why NFS@Home?
Previous participation in volunteer computing and an interest in integer factorization, led to following the development of the GGNFS and msieve implementations of Number Field Sieve (NFS). NFSNet had been developed for distribution of NFS sieving, but never caught on. Creating a BOINC project at this point was considered, but BOINC project RSA Lattice Siever had been launched to distribute the NFS sieving to factor the signing keys for TI calculators.
Dr. Greg Childers contributed to RSA Lattice Siever behind the scenes and assisted with the linear algebra. Implementation details were shared in return, which was used to inform the development and launch of NFS@Home.
Goal
Once the TI keys were done, the RSA Lattice Siever project continued with smaller numbers while NFS@Home focused on factoring larger numbers. After about three years, RSA Lattice Siever lost interest in continuing, so their work was merged into NFS@Home with the addition of queues for smaller factorizations.
Methods
- always including "why BOINC"?
- (Optional) insert MediaWiki image or upload
example MediaWiki image - impactful final statement
Project team / Sponsors
NFS@Home is developed by Dr. Greg Childers and is based at California State University Fullerton and support by grants from the National Science Foundation ACCESS program.
Scientific results
All results are posted on the NFS@Home web page.
- Detailed status of lasieved
- Detailed status of lasievee_small
- Detailed status of lasievee
- Detailed status of lasievef_small
Cunningham factors are posted on the Cunningham project website.