查看“NFS@Home”的源代码

{{Infobox Project
| name =NFS@Home
| logo =[[Image:NFS_at_Home_Logo.jpg|230px]]
| screenshot =无屏保图形
| caption =
| developer =[http://www.fullerton.edu/ 美国加州州立大学富尔顿分校]
| released =2009年9月
| operating system =[[Image:Windows.png]]/[[Image:Linux.png]][[Image:64bits.png]]
| platform =[[BOINC]]
| program info =15e Lattice Sieve≈312.8MB<br>
16e Lattice Sieve≈669.0MB
| work unit info =
| status =运行中/开放注册
| genre =数学类
| optimization =无
| website =http://escatter11.fullerton.edu/nfs/
}}
[[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 [http://en.wikipedia.org/wiki/Multiplicative_function 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 [http://zh.wikipedia.org/wiki/RSA加密演算法 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 [http://homes.cerias.purdue.edu/~ssw/cun/index.html 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 [http://www.ams.org/online_bks/conm22/ free download]. All results obtained since, including those of NFS@Home, are available on the Cunningham project website. 

NFS@Home is hosted at [http://www.fullerton.edu/ California State University Fullerton].


{{JoinBoincProject
|Project=NFS@Home
|URL=http://escatter11.fullerton.edu/nfs/
}}

{{BOINC topics}}
[[Category:分布式计算项目]][[Category:数学类项目]][[Category:BOINC 平台上的项目]][[Category:NFS@Home]][[Category:待翻译]]