【24h】

On the Role of Key Schedules in Attacks on Iterated Ciphers

机译:关键时间表在迭代密码攻击中的作用

获取原文
获取原文并翻译 | 示例

摘要

This paper considers iterated ciphers and their resistance against linear and differential cryptanalysis. In the theory of these attacks one assumes independence of the round keys in the ciphers. Very often though, the round keys are computed in a key schedule algorithm from a short key in a nonrandorn fashion. In this paper it is shown by experiments that ciphers with complex key schedules resist both attacks better than ciphers with more straightforward key schedules. It is well-known that by assuming independent round keys the probabilities of differentials and linear hulls can be modeled by Markov chains and that for most such ciphers the distribution of the probabilities of these converge to the uniform distribution after some number of rounds. The presented experiments illustrate that some iterated ciphers with very simple key schedules will never reach this uniform distribution. Also the experiments show that ciphers with well-designed, complex key schedules reach the uniform distribution faster (using fewer rounds) than ciphers with poorly designed key schedules. As a side result it was found that there exist ciphers for which the differential of the highest probability for one fixed key is also the differential of the highest probability for any other key. It is believed that this is the first such example provided in the literature.
机译:本文考虑了迭代密码及其对线性和差分密码分析的抵抗力。在这些攻击的理论中,人们假设密码中的圆形密钥是独立的。但是,通常情况下,回合密钥是通过密钥调度算法以非randorn方式从短键中计算出来的。在本文中,通过实验表明,具有复杂密钥计划的密码比具有更简单密钥计划的密码更能抵抗两种攻击。众所周知,通过假设独立的回合密钥,可以用马尔可夫链对差分和线性船体的概率进​​行建模,并且对于大多数此类密码,这些概率的分布在经过若干回合后会收敛为均匀分布。提出的实验表明,具有非常简单的密钥计划的某些迭代密码永远不会达到这种均匀分布。实验还表明,与设计较差的密钥计划相比,设计良好,复杂的密钥计划的密码更快(使用较少的回合)达到均匀分布。作为附带结果,发现存在一种密码,对于该密码,一个固定密钥的最高概率的差异也是任何其他密钥的最高概率的差异。相信这是文献中提供的第一个这样的例子。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号