摘要
流密码HC-256'是eSTREAM计划候选密码HC-256的改进算法,至今未见关于HC-256'的安全性分析结果。该文提出了一种针对HC-256'的线性区分攻击,利用不同的非线性函数代替内部状态更新函数来寻找偶数位置上密钥流生成序列的弱点,通过线性逼近HC-256'的内部状态构造区分器。分析结果表明,需要约2 281bit,就能以0.9545的区分优势对密钥流进行区分。同时,该攻击为解决Sekar等人在2009年IWSEC会议上提出的问题进行了有益的探索。
Stream cipher HC-256' is an improved algorithm of HC-256 which is proposed as a candidate to the eSTREAM project.Until now,there has not any cryptanalysis on HC-256'.In this paper,a linear distinguishing attack on HC-256' is presented.This method uses different nonlinear functions instead of state update functions to exploit the weaknesses in the even positions output bits of the keystream generation sequence.By linear approximation to the internal state bits,a distinguisher is built.The result shows that there needs about 281 2 bit keystream with advantage 0.9545 to distinguish HC-256' form random sequence.Thereby,this is a beneficial attempt to solve a problem which is given by Sekar et al in IWSEC 2009.
出处
《电子与信息学报》
EI
CSCD
北大核心
2012年第4期807-811,共5页
Journal of Electronics & Information Technology
基金
国家973计划项目(2007CB311201)
保密通信国防科技重点实验室基金(9140C110201110C1102)
国家自然科学基金(60970119
60833008)
西安建筑科技大学青年基金(QN1024)资助课题