| 一种基于后验概率判决的one-by-one快速相关攻击算法(英文) |
| |
| 引用本文： | 祝捷,陈剑清,刘文芬,李世取.一种基于后验概率判决的one-by-one快速相关攻击算法(英文)[J].应用数学,2004(Z2). |
| |
| 作者姓名： | 祝捷 陈剑清 刘文芬 李世取 |
| |
| 作者单位： | 解放军信息工程大学信息研究系 河南郑州450002
(祝捷，陈剑清，刘文芬)，解放军信息工程大学信息研究系 河南郑州450002(李世取) |
| |
| 摘 要： | 本文描述了一种基于后验概率判决的 one by one快速相关攻击算法.本文试图通过概率的观点来看待和分析快速相关攻击问题.该算法的优点有以下三点.首先,和文献5]相比 one by one算法减少了对存储空间的需求.其次,提出了攻击失败概率的概念,并利用中心极限定理给出了它和密钥流序列长度的关系.最后,和文献4]相比,该算法只需要更少的密钥流序列就可以达到几乎相同的攻击效果.
|
| 关 键 词： | 流密码 快速相关攻击 后验概率判决 中心极限定理 |
A One-by-One Algorithm Based on Decision of Posteriori Probability for Fast Correlation Attacks |
| |
| ZHU Jie,CHEN Jian qing,LIU Wen fen,LI Shi qu.A One-by-One Algorithm Based on Decision of Posteriori Probability for Fast Correlation Attacks[J].Mathematica Applicata,2004(Z2). |
| |
| Authors: | ZHU Jie CHEN Jian qing LIU Wen fen LI Shi qu |
| |
| Abstract: | This paper describes a one by one algorithm for fast correlation attacks based on decision of posteriori probability.We try to deal with attack problems from the point of view of probability theory.The advantages of our algorithm are at least three.Firstly,it remarkably reduces the memory requirements compared with the algorithm in 5].Secondly,we propose a concept of the failure probability of attack and give the exact relation between it and the length of keystream by theoretical analysis.Lastly,compared with the algorithm in 4],our algorithm decreases the requirement for the length of keystream and achieves the same performance. |
| |
| Keywords: | Stream ciphers Fast correlation attack Decision of posteriori probability |
| 本文献已被 CNKI 等数据库收录！ |
