Low data complexity inversion attacks on stream ciphers via truncated compressed preimage sets
文献类型：会议论文
| 作者 | Zhong, Xiao (1) ; Wang, Mingsheng (3) ; Zhang, Bin (1) ; Wu, Shengbao (1) |
| 出版日期 | 2014 |
| 会议名称 | 19th Australasian Conference on Information Security and Privacy, ACISP 2014 |
| 会议日期 | July 7, 2014 - July 9, 2014 |
| 会议地点 | Wollongong, NSW, Australia |
| 页码 | 131-147 |
| 中文摘要 | 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 T |
| 英文摘要 | 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 T |
| 收录类别 | EI |
| 会议录出版地 | Springer Verlag |
| 语种 | 英语 |
| ISSN号 | 3029743 |
| ISBN号 | 9783319083438 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/16589]  |
| 专题 | 软件研究所_软件所图书馆_会议论文 |
| 推荐引用方式 GB/T 7714 | 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. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。