Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (16): 152-155.
• 网络、通信与安全 • Previous Articles Next Articles
HU Xue-xian,NA Jian,LIU Wen-fen
Received:
Revised:
Online:
Published:
Contact:
胡学先,那 键,刘文芬
通讯作者:
Abstract: A method for efficiently computing the conditional probability of the output sequence of Py is given, which is based on the theory of hidden Markov model, and from this a distinguisher optimal for this model is built. For the same advantage as that of the best known distinguisher,this attack results in a reduction in the samples needed by a factor of approximately 3.2.
摘要: 提出了对流密码算法的一种改进的区分攻击方法。首先利用隐Markov模型给出了有效计算的输出序列在一个特定的事件发生的情况下的条件分布的公式,并由此构造了一个“最优”区分器,在区分优势和目前最有效的区分攻击相同的情况下,所需密钥流长度缩短为原来的1/3.2。
HU Xue-xian,NA Jian,LIU Wen-fen. Improved distinguishing attack on Py[J]. Computer Engineering and Applications, 2007, 43(16): 152-155.
胡学先,那 键,刘文芬. 对Py的一种改进的区分攻击[J]. 计算机工程与应用, 2007, 43(16): 152-155.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/
http://cea.ceaj.org/EN/Y2007/V43/I16/152