1990年代末，DES（数据加密标准）的安全性受到挑战。1997年，RSA赞助的比赛被DESCHALL项目赢得，他们利用互联网上数千台电脑的空闲计算能力成功破解了DES。同年，电子前沿基金会（EFF）建造了一台专门的DES破解机，证实了DES在实践中也可被快速破解，耗资约25万美元。这些事件表明DES已不再适合作为可靠的加密标准。
以下是引用zl_168在2006-5-29 12:44:54的发言：
在1997——1998年的时候，美国有人就完成了这样的穷举搜索，但是人家利用的是大型机，或是几百台机器的分布式计算，要使用自己的pc来穷举的话，基本上是不可能完成的任务了！！
In academia, various proposals for a DES-cracking machine were advanced. In 1977, Diffie and Hellman proposed a machine costing an estimated US$20 million which could find a DES key in a single day. By 1993, Wiener had proposed a key-search machine costing US$1 million which would find a key within 7 hours. The vulnerability of DES was practically demonstrated in the late 1990s. In 1997, RSA Security sponsored a series of contests, offering a $10,000 prize to the first team that broke a message encrypted with DES for the contest. That contest was won by the DESCHALL Project, led by Rocke Verser, Matt Curtin, and Justin Dolske, using idle cycles of thousands of computers across the Internet. The feasibility of cracking DES quickly was demonstrated in 1998 when a custom DES-cracker was built by the Electronic Frontier Foundation (EFF), a cyberspace civil rights group, at the cost of approximately US$250,000. Their motivation was to show that DES was breakable in practice as well as in theory: "There are many people who will not believe a truth until they can see it with their own eyes. Showing them a physical machine that can crack DES in a few days is the only way to convince some people that they really cannot trust their security to DES." The machine brute-forced a key in a little more than 2 days' search; at about the same time at least one attorney from the US Justice Department was announcing that DES was unbreakable.
---
from Wikipedia
[此贴子已经被作者于2006-8-13 11:30:18编辑过]
扫一扫
1447
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
