http://escatter11.fullerton.edu/nfs/index.php
About NFS@Home
NFS@Home is a research project that uses Internet-connected computers to do the lattice sieving step in the Number Field Sieve factorization of large integers. As a young school student, you gained your first experience at breaking an integer into prime factors, such as 15 = 3 * 5 or 35 = 5 * 7. NFS@Home is a continuation of that experience, only with integers that are hundreds of digits long. Most recent large factorizations have been done primarily by large clusters at universities. With NFS@Home you can participate in state-of-the-art factorizations simply by downloading and running a free program on your computer.
Integer factorization is interesting from both mathematical and practical perspectives. Mathematically, for instance, the calculation of multiplicative functions in number theory for a particular number require the factors of the number. Likewise, the integer factorization of particular numbers can aid in the proof that an associated number is prime. Practically, many public key algorithms, including the RSA algorithm, rely on the fact that the publicly available modulus cannot be factored. If it is factored, the private key can be easily calculated. Until quite recently, RSA-512, which uses a 512-bit modulus (155 digits), was commonly used but can now be easily broken.
The numbers what we are factoring are chosen from the Cunningham project. Started in 1925, it is one of the oldest continuously ongoing projects in computational number theory. The third edition of the book, published by the American Mathematical Society in 2002, is available as a free download. All results obtained since, including those of NFS@Home, are available on the Cunningham project website.
NFS@Home is hosted at California State University Fullerton, and is supported in part by the National Science Foundation through XSEDE resources provided by the Texas Advanced Computing Center, the San Diego Supercomputer Center, the National Center for Supercomputing Applications, and Purdue University under grant number TG-DMS100027.
NFS@Home project description
Forum rules
#1 NFS@Home project description
The best form of help from above is a sniper on the rooftop....
-
- Boinc Warrant Officer Class 2
- Posts: 321
- Joined: Sun Feb 21, 2016 11:22 am
- Location: Milton Keynes, UK
#2 Re: NFS@Home project description
Hi,
I am a team member of SETI.USA but moderator at NFS@Home project so any queries please let me know.
Kind Regards,
Carlos
I am a team member of SETI.USA but moderator at NFS@Home project so any queries please let me know.
Kind Regards,
Carlos
SETI.USA member
- Dirk Broer
- Corsair
- Posts: 1964
- Joined: Thu Feb 20, 2014 11:24 pm
- Location: Leiden, South Holland, Netherlands
- Contact:
#3 Re: NFS@Home project description
I got a question: Why do the 14e and 15e Lattice pay so poorly in credits, compared to the 16e ?
-
- Boinc Warrant Officer Class 2
- Posts: 321
- Joined: Sun Feb 21, 2016 11:22 am
- Location: Milton Keynes, UK
#4 Re: NFS@Home project description
In the beginning of the project there weren't too many machines able to run the 16e lattice siever due to its memory usage and admin Greg set as higher payment for this ones. Also running 16e siever you're helping record factorisation. Overall Greg is rewarding the most difficult tasks.
In several discussion I had with him I requested a change on the 14e and 15e credit to at least the double as away to also reward and push forward the small projects NFS help. No change of minds so far.
In several discussion I had with him I requested a change on the 14e and 15e credit to at least the double as away to also reward and push forward the small projects NFS help. No change of minds so far.
SETI.USA member