NFS@Home: Difference between revisions

Line 1:

~~<div style="background-color: #D4E2FC; border-top: 1px solid #5F92F2; font-size: bigger; padding-left: 15px; margin: 12px -5px -5px -5px;">'''BOINC project page template'''</div>~~

[[File:{{#setmainimage:Nfs.jpg}}|alt=logo image|center|frameless]]

Line 6:

Line 4:

== 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.

* why this topic/~~object~~ of ~~study?~~

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 ==

* summarize the ~~objectives and challenges which~~ the project ~~addresses~~, ~~before jumping~~ into ~~details~~

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 ==

@@ Line 1: / Line 1: @@
-<div style="background-color: #D4E2FC; border-top: 1px solid #5F92F2; font-size: bigger; padding-left: 15px; margin: 12px -5px -5px -5px;">'''BOINC project page template'''</div>
 [[File:{{#setmainimage:Nfs.jpg}}|alt=logo image|center|frameless]]
@@ Line 6: / Line 4: @@
 == 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.
-* why this topic/object of study?
+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 ==
-* summarize the objectives and challenges which the project addresses, before jumping into details
+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 ==