论文部分内容阅读
本文介绍丁对分组密码的一种新型攻击,它比以前考虑的所有攻击都强。这种“选择密钥攻击”是已被普遍接受的选择明文攻击的一种推广。我们给出了一个例子,说明在选择明文攻击下不可破的分组密码,却立刻为选择密钥攻击所破。一般选择密钥攻击在2~(n/2)次运算内可破n比特密钥。黑箱理论证明对于通常的攻击,这个结果是最好的。
This article introduces a new type of attack on block ciphers that is stronger than all attacks considered previously. This “selective key attack” is an extension of the generally accepted choice of plaintext attack. We give an example of an unbreakable block cipher under a plaintext attack, which is immediately broken by the selective key attack. The general choice key attack can break the n-bit key within 2 ~ (n / 2) operations. Black-box theory proves that this result is best for normal attacks.