首页 | 本学科首页   官方微博 | 高级检索  
     

广义自缩生成器的猜测决定攻击
引用本文:余昭平廖翠玲卢建军刘如玉,张建康,刘广彦.广义自缩生成器的猜测决定攻击[J].信息工程大学学报,2011,12(2):154-157.
作者姓名:余昭平廖翠玲卢建军刘如玉  张建康  刘广彦
作者单位:1. 信息工程大学,电子技术学院,河南,郑州,450004
2. 郑州大学,升达经贸管理学院,河南,郑州,451191
基金项目:现代通信国家重点实验室基金资助项且
摘    要:利用猜测决定攻击分析了广义自缩生成器的安全性。结果表明,n级线性移位寄存器构成的广义自缩生成器的猜测决定攻击的时间复杂度为O(n3·1/(2(1+α)n)),存储复杂度为O(n2),数据复杂度为O((1-β)/(2(1+α)N))。猜测决定攻击可以以一定概率实现在不同条件下对广义自缩生成器的攻击,因此不失为一种良好的攻击方法。

关 键 词:自缩生成器  广义自缩生成器  区分攻击  猜测攻击

Guess-and-Determine Attack on Generalized Self-Shrinking Generators
YU Zhao-ping,LIAO Cui-ling,LU Jian-jun,LIU Ru-yu,ZHANG Jian-kang,LIU Guang-yan.Guess-and-Determine Attack on Generalized Self-Shrinking Generators[J].Journal of Information Engineering University,2011,12(2):154-157.
Authors:YU Zhao-ping  LIAO Cui-ling  LU Jian-jun  LIU Ru-yu  ZHANG Jian-kang  LIU Guang-yan
Affiliation:YU Zhao-ping1,LIAO Cui-ling1,LU Jian-jun1,LIU Ru-yu2,ZHANG Jian-kang2,LIU Guang-yan2(1.Institute of Electronic Technology,Information Engineering University,Zhengzhou 450004,China,2.Management College of Shengda Economy and Trade,Zhengzhou 451191,China)
Abstract: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.
Keywords:self-shrinking generator  generalized self-shrinking generator  distinguish attack  guess-and-determine attack  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《信息工程大学学报》浏览原始摘要信息
点击此处可从《信息工程大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号