文件名称:gggggggggggggggggggggggggggggg
介绍说明－－下载内容均来自于网络，请自行研究使用
假定穷举法攻击有效的话，那么即使设计一种每秒种可以试验10亿个密钥的专用芯片，并将10亿片这样的芯片用于此项工作，
仍需1013年才能解决问题；另一方面，若用1024片这样的芯片，有可能在一天内找到密钥，不过人们还无法找到足够的硅原子来
制造这样一台机器。
-assumed exhaustive law effective attack, then even the design of a second species can test one billion Key ASIC, and one billion for the chip of this work, and still can be resolved in 1013; If, however, used the 1024 chip, it is possible in one day find key, but people still can not find enough silicon atoms to create such a machine.
仍需1013年才能解决问题；另一方面，若用1024片这样的芯片，有可能在一天内找到密钥，不过人们还无法找到足够的硅原子来
制造这样一台机器。
-assumed exhaustive law effective attack, then even the design of a second species can test one billion Key ASIC, and one billion for the chip of this work, and still can be resolved in 1013; If, however, used the 1024 chip, it is possible in one day find key, but people still can not find enough silicon atoms to create such a machine.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Cpp1.cpp
Cpp2.cpp
Cpp3.cpp
Cpp2.cpp
Cpp3.cpp