CAPEC-20: Encryption Brute Forcing
CAPEC版本: 3.9
更新日期: 2023-01-24
攻击模式描述
An attacker, armed with the cipher text and the encryption algorithm used, performs an exhaustive (brute force) search on the key space to determine the key that decrypts the cipher text to obtain the plaintext.
执行流程
步骤 1 Explore
Determine the ciphertext and the encryption algorithm.
步骤 2 Experiment
Perform an exhaustive brute force search of the key space, producing candidate plaintexts and observing if they make sense.
前提条件
- Ciphertext is known.
- Encryption algorithm and key size are known.
所需技能
所需资源
后果影响
影响范围: Confidentiality
技术影响: Read Data
缓解措施
Use commonly accepted algorithms and recommended key sizes. The key size used will depend on how important it is to keep the data confidential and for how long.
In theory a brute force attack performing an exhaustive key space search will always succeed, so the goal is to have computational security. Moore's law needs to be taken into account that suggests that computing resources double every eighteen months.
示例实例
In 1997 the original DES challenge used distributed net computing to brute force the encryption key and decrypt the ciphertext to obtain the original plaintext. Each machine was given its own section of the key space to cover. The ciphertext was decrypted in 96 days.