“MilestoneRSA”的版本间差异
小 (修正代码) |
Zhouxiaobo(讨论 | 贡献) 小 (已结束。) |
||
(未显示另一用户的1个中间版本) | |||
第1行: | 第1行: | ||
− | {{ | + | {{cleanup|cuihao|没翻译}} |
− | | name =MilestoneRSA | + | {{Project |
− | | logo = | + | |name=MilestoneRSA |
− | + | |logo= | |
− | + | |developer=[http://poseidon.shacknet.nu:8080/MilestoneRSA/show_user.php?userid=1 Poseidon] | |
− | | developer =[http://poseidon.shacknet.nu:8080/MilestoneRSA/show_user.php?userid=1 Poseidon] | + | |released=2010年12月21日启动 |
− | | released =2010年12月21日启动 | + | |app={{app/Windows}}{{app/Linux}} |
− | | | + | |platform={{platform/BOINC}} |
− | | platform = | + | |subproject= |
− | | | + | |status=已结束&网站无法打开 |
− | + | |genre={{genre/数学|密码学}} | |
− | | status = | + | |website=http://poseidon.shacknet.nu:8080/MilestoneRSA/ |
− | | genre = | + | |rss=http://poseidon.shacknet.nu:8080/MilestoneRSA/rss_main.php |
− | | | ||
− | | website =http://poseidon.shacknet.nu:8080/MilestoneRSA/ | ||
− | | rss =http://poseidon.shacknet.nu:8080/MilestoneRSA/rss_main.php | ||
}} | }} | ||
第38行: | 第35行: | ||
{{BOINC topics}} | {{BOINC topics}} | ||
− | + | [[Category:已结束项目]] | |
− | [[Category: |
2017年12月6日 (三) 15:42的最新版本
当前页面或段落存在质量问题 当前页面或段落不符合页面质量要求,使用了不规范的语言或是提供了错误的信息,可能误导读者,希望了解相关内容的Wiki用户协助改善。
用户 cuihao 给出的意见是:没翻译 。 其他用户若有异议,请前往讨论:MilestoneRSA发表见解。 欢迎无wiki账号的用户到论坛的Wiki系统讨论区(注册)参与讨论。 |
MilestoneRSA 项目试图对 Motorola Bootloader 的 1024 bit RSA 进行破解。
由于项目采用最原始的试除法进行破解,相对于 1024 bit 的 RSA 来说没有任何意义,是一种对计算资源的浪费,这里不建议大家参加该项目。
MilestoneRSA is a boinc project trying to break a 1024 bit RSA key used by Motorola to sign the boot and recovery partitions on the Motorola Milestone. If this key could be broken, we would be able to sign our own boot/recovery images, which would enable us to run custom kernels and recovery images on the Milestone.
It is, of course, very unlikely that a 1024 bit RSA key can be broken. To break an RSA key, a large (1024 bits in our case) number n has to be factorized (split into its prime factors, of which there must be exactly two in the case of an RSA key). If those two prime numbers (p, q with p*q=n) can be found, the private key can be calculated instantly.
One of the best algorithms to factor large integers is the General Number Field Sieve, but even this algorithm would run several centuries on recent hardware to factor a 1024 bit integer. The GNFS guarantees a correct solution, but only after it has ended, so it is not feasable to use it.
This project uses the very naive bruteforce approach. In the worst case this algorithm will find the solution only after the earth is long gone (as in 'never' ;)), but there is a minimal chance that we're lucky and guess the correct key. To be honest, I cannot think of many events that are more unlikely to happen than finding the key, but it won't do any harm to try, so i encourage everyone with a few unused cpu cycles to follow the instructions below and join MilestoneRSA!
如何加入项目
该项目基于 BOINC 平台,简要的加入步骤如下(已完成的步骤可直接跳过):
- 下载并安装 BOINC 的客户端软件(官方下载页面或程序下载)
- 点击客户端简易视图下的“Add Project”按钮,或高级视图下菜单中的“工具->加入项目”,将显示向导对话框
- 点击下一步后在项目列表中找到并单击选中 MilestoneRSA 项目(如未显示该项目,则在编辑框中输入项目网址:http://poseidon.shacknet.nu:8080/MilestoneRSA/ ),然后点击下一步
- 输入您可用的电子邮件地址,并设置您在该项目的登录密码(并非您的电子邮件密码)
- 再次点击下一步,如项目服务器工作正常(并且有适合自身操作系统的计算程序),即已成功加入项目
更详细的加入方法说明,请访问 BOINC 新手指南 或 BOINC 使用教程。
本站推荐您加入 Team China 团队,请访问项目官方网站的 团队检索页面,搜索(Search)并进入 Team China 的团队页面,点击页面中的 Join 并输入用户登录信息即可加入!