![]()
出典:Wikipedia
出典:『Wikipedia』 (2011/08/04 05:14 UTC 版)
In cryptography, a brute-force attack or exhaustive key search is a strategy that can in theory be used against any encrypted data by an attacker who is unable to take advantage of any weakness in an encryption system that would otherwise make his/her task easier. It involves systematically checking all possible keys until the correct key is found. In the worst case, this would involve traversing the entire search space.