Related-Key and Slide Attacks Analysis, Connections, and Improvements Extended Abstract.pdf

Related-Key and Slide Attacks Analysis, Connections, and Improvements Extended Abstract.pdf

  1. 1、本文档共11页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Related-Key and Slide Attacks Analysis, Connections, and Improvements Extended Abstract

Related-Key and Slide Attacks: Analysis, Connections, and Improvements ?Extended Abstract? Mathieu Ciet, Gilles Piret, and Jean-Jacques Quisquater Universite? catholique de Louvain, Crypto Group Place du Levant, 3 1348 Louvain-la-Neuve, Belgium {ciet, piret, jjq}@dice.ucl.ac.be ? http://www.dice.ucl.ac.be/~crypto Abstract. In this paper we present the most important results devel- oped in key schedule cryptanalysis during the last ten years. Namely, we deal with related-key attacks, differential related-key attacks, and slide attacks. The related-key attack is presented in a more general framework than in the paper of Biham [1]. We give two improvements to the slide attacks. Finally, the link between these attacks is studied. 1 Introduction The most well known attacks on block ciphers are those targeting at the ci- phering itself, for example the linear and differential cryptanalysis. In this paper we present attacks that are particular in the sense that they focus on the key scheduling. Firstly, the related key attack, introduced by Eli Biham in [1], sec- ondly a variant with differential related key attack and finally the slide attack developed by Alex Biryukov and David Wagner [5, 6]. Biham’s related-key attack is presented in a general framework. We also give two personal improvements to the slide attack. Finally, we emphasize on the strong link between these attacks. 2 Related-key Attacks 2.1 The chosen key attack The basic related-key attack that we refer as ”chosen key attack” relies on an un- usual hypothesis: namely, encryption is performed using two unknown different keys that have a particular relationship known to the attacker. First we present the attack in a general framework; the first step is to describe the relationship that must be satisfied by the two keys K and K?, in order to be vulnerable to Biham’s attack. Then we analyze what can be improved if we are dealing with the particular case of a Feistel cipher. 2 Mathieu Ciet, Gilles Piret, and Jean

您可能关注的文档

文档评论(0)

l215322 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档