...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Kybernetika >A RELATED-KEY ATTACK ON ITERATED CHAOTIC CIPHERS
【24h】

A RELATED-KEY ATTACK ON ITERATED CHAOTIC CIPHERS

机译：迭代混沌的相关密钥攻击

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper, we present a new type of attack on iterated chaotic ciphers using related keys. Based on the fact that a chaotic sequence is not sensitive to the less significant bits of initial conditions and parameters, a divide-and-conquer attack on iterated chaotic ciphers was presented by us before, which significantly reduces the computing complexity of attacks. However, if the information leaked is significant according to the distribution of the coincidence degrees, a measure for the information leakage of chaotic ciphers, or the size of the key is large, then it is difficult for the divide-and-conquer attack to reduce its computing complexity into a realizable level. The related-key attack we present in this paper simultaneously uses the information leaked from different chaotic sequences generated by related keys and combines the ideas of linear cryptanalysis and divide-and-conquer attack together, hence greatly enhances the efficiency of divide-and-conquer attack. As an example, we test the related-key attack on the ZLL chaotic cipher with a 64-bit key on a Pentium IV 2.5 GHz PC, which takes only 8 minutes and 45 seconds to recover all bits of the key successfully.
机译：在本文中，我们提出了一种使用相关密钥对迭代混沌密码进行新型攻击的方法。基于混沌序列对初始条件和参数的次有效位不敏感的事实，以前我们提出了对迭代混沌密码的分治法攻击，这大大降低了攻击的计算复杂度。但是，如果根据重合度的分布，信息泄漏很重要，或者混沌密码信息泄漏的措施，或者密钥的大小很大，那么分治法攻击就很难减少它的计算复杂度达到了可实现的水平。本文提出的关联密钥攻击同时利用了从相关密钥产生的不同混沌序列中泄漏的信息，并将线性密码分析与分治攻击的思想结合在一起，从而大大提高了分治的效率。攻击。例如，我们在奔腾IV 2.5 GHz PC上用64位密钥测试ZLL混沌密码上的相关密钥攻击，成功恢复密钥的所有位仅需8分45秒。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号