摘要
利用猜测决定攻击分析了广义自缩生成器的安全性。结果表明,n级线性移位寄存器构成的广义自缩生成器的猜测决定攻击的时间复杂度为O(n3·1/(2(1+α)n)),存储复杂度为O(n2),数据复杂度为O((1-β)/(2(1+α)N))。猜测决定攻击可以以一定概率实现在不同条件下对广义自缩生成器的攻击,因此不失为一种良好的攻击方法。
This paper pcesents a kind of guess-and-determine attack on generalized self-shrinking generators.The results show that its time complexity is O（n3·1/（2（1＋α）n））,memory complexity is O（n2）,and data complexity is O（（1-β）/（2（1＋α）N））.The guess-and-determine attack can be realized under different conditions with some probability,so it＇s one of good attack methods.
出处
《信息工程大学学报》
2011年第2期154-157,共4页
Journal of Information Engineering University
基金
现代通信国家重点实验室基金资助项目(9140C1102060702)
关键词
自缩生成器
广义自缩生成器
区分攻击
猜测攻击
self-shrinking generator
generalized self-shrinking generator
distinguish attack
guess-and-determine attack
