中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 会议论文
Title:
Low data complexity inversion attacks on stream ciphers via truncated compressed preimage sets
Author: Zhong, Xiao (1) ; Wang, Mingsheng (3) ; Zhang, Bin (1) ; Wu, Shengbao (1)
Conference Name: 19th Australasian Conference on Information Security and Privacy, ACISP 2014
Conference Date: July 7, 2014 - July 9, 2014
Issued Date: 2014
Conference Place: Wollongong, NSW, Australia
Publish Place: Springer Verlag
Indexed Type: EI
ISSN: 3029743
ISBN: 9783319083438
Department: (1) Trusted Computing and Information Assurance Laboratory, Institute of Software, Chinese Academy of Sciences, Beijing, China; (2) Graduate School, Chinese Academy of Sciences, Beijing, China; (3) State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China; (4) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China
Abstract: This paper focuses on the analysis of LFSR-based stream ciphers with low data complexity. We introduce a novel parameter called the k-th truncated compressed preimage set (TCP set), and propose a low data complexity attack to recover the initial LFSR state via the TCP sets. Our method costs very few keystream bits and less time than the brute force under some condition. We apply our method to a 90-stage LFSR-based keystream generator with filter Boolean function which can resist the algebraic attack and inversion attack given by Goli to the greatest extent. It needs only 10-bit keystream to recover the 90-bit initial state, costing less time and data than the algebraic attack. The time complexity is also less than that of the inversion attack. Moreover, we recover the 128-bit initial state of the stream cipher LILI-128 with our method. The data cost is just 9 keystream bits along with a memory cost of O(2 8.5), which is the minimum data cost to theoretically break LILI-128 so far as we know. The time complexity is O(2122.4), better than the brute force. We also define a new security parameter called Tcomp and suggest a design criterion for the LFSR-based stream ciphers. © 2014 Springer International Publishing Switzerland.
English Abstract: This paper focuses on the analysis of LFSR-based stream ciphers with low data complexity. We introduce a novel parameter called the k-th truncated compressed preimage set (TCP set), and propose a low data complexity attack to recover the initial LFSR state via the TCP sets. Our method costs very few keystream bits and less time than the brute force under some condition. We apply our method to a 90-stage LFSR-based keystream generator with filter Boolean function which can resist the algebraic attack and inversion attack given by Goli to the greatest extent. It needs only 10-bit keystream to recover the 90-bit initial state, costing less time and data than the algebraic attack. The time complexity is also less than that of the inversion attack. Moreover, we recover the 128-bit initial state of the stream cipher LILI-128 with our method. The data cost is just 9 keystream bits along with a memory cost of O(2 8.5), which is the minimum data cost to theoretically break LILI-128 so far as we know. The time complexity is O(2122.4), better than the brute force. We also define a new security parameter called Tcomp and suggest a design criterion for the LFSR-based stream ciphers. © 2014 Springer International Publishing Switzerland.
Language: 英语
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/16589
Appears in Collections:软件所图书馆_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Zhong, Xiao ,Wang, Mingsheng ,Zhang, Bin ,et al. Low data complexity inversion attacks on stream ciphers via truncated compressed preimage sets[C]. 见:19th Australasian Conference on Information Security and Privacy, ACISP 2014. Wollongong, NSW, Australia. July 7, 2014 - July 9, 2014.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Zhong, Xiao (1)]'s Articles
[Wang, Mingsheng (3)]'s Articles
[Zhang, Bin (1)]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Zhong, Xiao (1)]‘s Articles
[Wang, Mingsheng (3)]‘s Articles
[Zhang, Bin (1)]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace