破解安全密钥
愚蠢的老我又提出了另一个简单的问题。
我们不断听到有人抛出大数字，例如密钥：
234234-234WEF-ER334AS-3535FWF
任何人都需要 200 亿亿年才能破解。
有人能解释一下你怎么知道你已经破解了它吗？如果你排列了一万亿个组合，你怎么知道你是否通过了正确的组合？当然，您必须在实时系统上对其进行测试，该系统无法如此快地处理那么多请求，并且半脑的系统管理员会注意到这种攻击。
我一直看到“破解钥匙############”的竞赛，你如何知道你何时找到了解决方案？您神奇地遇到了英文短语“Ha you won't find me!”或其他什么？
我缺少什么？
Another simple question from silly old me.
We keep hearing big numbers being thrown around, for example the key:
234234-234WEF-ER334AS-3535FWF
Would take 20 billion gazillion years for anyone to crack.
Could someone explain how you even know when you have cracked it? If you have permutated a trillion combinations how do you know if you have passed the correct one? Surely you would have to test it on the live system which wouldn't be able to handle that many requests so fast, and a half brained system admin would notice the attack.
I keep seeing competitions to 'crack the key ############', how are you meant to know when you have a solution? You magically come across the english phrase "Ha you wont find me!" or something?
What am I missing?
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（3）
如果您正在谈论公钥加密，您可以判断何时破解了密钥，如果您可以访问公钥（而且您经常这样做 - 它通常是公开的，因此得名）。这意味着您可以离线进行攻击，并且可以通过对您选择的消息执行
decrypt(encrypt(message))来轻松验证您是否找到了私钥，并检查是否获得了正确的结果后退。您还可以经常用数学方法验证结果。例如，使用 RSA 算法，如果您可以分解公钥中的数字，那么您可以证明您已找到正确的私钥，因为在生成私钥时使用了质因数。
If you are talking about public key cryptography you can tell when you have cracked the key if you have access to the public key (and you often do - it's typically made public, hence its name). This means you can do the attack offline and you can easily verify that you have found the private key by performing
decrypt(encrypt(message))for a message of your choice and check that you get the correct result back.You can also often verify the result mathematically. For example with the RSA algorithm if you can factorize the number in the public key then you can prove that you have found the correct private key because the prime factors are used in the generation of the private key.
密钥拾取过程有两个步骤：
如果您正在破解远程应用程序，所有者可以通过以某种方式限制验证来防止拾取。 （例如尝试 3 次，然后暂停）。如果您正在破解本地的某些内容，例如加密的 rar 文件，那么所有者可以通过进行繁重的验证操作（例如对其进行多次编码）来使挑选变得困难。
the key picking process has two steps:
If you are cracking remote application owner can prevent picking by limiting validations in some way. (3 attempts, then pause for example). If you are cracking something local, like encrypted rar file then owner can make picking hard by making validation heavy operation, like encode it several times.
当程序/算法/系统/任何验证密钥的内容接受它时。
根据他们试图破解的内容，攻击者可以自己进行验证。
When the program/algorithm/system/whatever validating the key accepts it.
Depending on what they are trying to crack, the attacker can do the validation him/herself.