论文部分内容阅读
本文提出了一种密码分析的概率方法,在需要N次运算的预计算之后,这方法以N~(2/3)次运算和N~(2/3)个存储字(平均值)对任何具有N个密钥的密码体制进行密码分析。如果预计算能够在一合理的时间周期(例如几年)内完成,那么这对于把恢复每个密钥需要的附加运算和穷举法(exhaustivesearch)需要的N次运算以及查表法(table lookup)需要的N个存储字进行比较是很有帮助的。当这种方法用来破译采用分组方式的数据加密标准(DES)时,它表明:每个解的费用将在1美元至100美元之间。这方法在选择明文攻击中有利,若未采用密码分组链(Cipher block chaining),这种方法也能够用于唯密文攻击(ciphertext-only attack)。
In this paper, we propose a cryptanalysis probabilistic method that uses N ~ (2/3) operations and N ~ (2/3) memory words (average) for any A cryptographic system with N keys performs cryptanalysis. If the pre-computation can be completed within a reasonable period of time (eg, a few years) then this is not sufficient for the N-th operation needed to recover the additional operations and exhaustive searches required for each key, as well as the table lookup ) It is helpful to compare the N memory words you need. When this method is used to decipher the packet-based data encryption standard (DES), it shows that the cost per solution will be between $ 1 and $ 100. This method is advantageous in choosing plaintext attacks, which can also be used for cipherrtext-only attacks if Cipher block chaining is not used.