“NFS@Home”的版本间差异
（更新WUProp内存数据） |
小 （更新国旗信息） |
||
| 第4行： | 第4行： | ||
| screenshot =无屏保图形 | | screenshot =无屏保图形 | ||
| caption = | | caption = | ||
| − | | developer =[http://www.fullerton.edu/ 美国加州州立大学富尔顿分校] | + | | developer =[http://www.fullerton.edu/ 美国加州州立大学富尔顿分校][[Image:United_States.gif]] |
| released =2009年9月 | | released =2009年9月 | ||
| − | | operating system =[[Image:Windows.png]]/[[Image:Linux.png]][[Image:64bits.png]] | + | | operating system =[[Image:Windows.png]] / [[Image:Linux.png]][[Image:64bits.png]] |
| platform =[[BOINC]] | | platform =[[BOINC]] | ||
| program info =15e Lattice Sieve≈312.8MB<br> | | program info =15e Lattice Sieve≈312.8MB<br> | ||
16e Lattice Sieve≈669.0MB | 16e Lattice Sieve≈669.0MB | ||
| − | | work unit info = | + | | work unit info =4日任务限期 |
| status =运行中/开放注册 | | status =运行中/开放注册 | ||
| genre =数学类 | | genre =数学类 | ||
2010年9月3日 (五) 16:58的版本
|
NFS@Home | |
|---|---|
 NFS@Home logo | |
| 无屏保图形 | |
| 开发者 | 美国加州州立大学富尔顿分校
|
| 版本历史 | 2009年9月 |
| 运算平台 |  /  
|
| 项目平台 | BOINC |
| 程序情况 | 15e Lattice Sieve≈312.8MB 16e Lattice Sieve≈669.0MB |
| 任务情况 | 4日任务限期 |
| 项目状态 | 运行中/开放注册 |
| 项目类别 | 数学类 |
| 优化程序 | 无 |
| 计算特点 | CPU密集： |
| 官方网址 | NFS@Home |
|
[{{{rss}}} 通过 RSS 获取项目新闻] |
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.
如何加入项目
该项目基于 BOINC 平台，简要的加入步骤如下（已完成的步骤可直接跳过）：
- 下载并安装 BOINC 的客户端软件（官方下载页面或程序下载）
- 点击客户端简易视图下的“Add Project”按钮，或高级视图下菜单中的“工具->加入项目”，将显示向导对话框
- 点击下一步后在项目列表中找到并单击选中 NFS@Home 项目（如未显示该项目，则在编辑框中输入项目网址：http://escatter11.fullerton.edu/nfs/ ），然后点击下一步
- 输入您可用的电子邮件地址，并设置您在该项目的登录密码（并非您的电子邮件密码）
- 再次点击下一步，如项目服务器工作正常（并且有适合自身操作系统的计算程序），即已成功加入项目
更详细的加入方法说明，请访问 BOINC 新手指南 或 BOINC 使用教程。
本站推荐您加入 Team China 团队，请访问项目官方网站的 团队检索页面，搜索（Search）并进入 Team China 的团队页面，点击页面中的 Join 并输入用户登录信息即可加入！
