中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页 机构 成果 学者
  
  1. CAS IR Grid
  2. 软件研究所
  3. 软件所图书馆
  4. 会议论文
an improved time-memory-data trade-off attack against irregularly clocked and filtered keystream generators

文献类型：会议论文

作者Jiao Lin ; Wang Mingsheng ; Zhang Bin ; Li Yongqiang
出版日期2013
会议名称8th China International Conference on Information Security and Cryptology, INSCRYPT 2012
会议日期November 28, 2012 - November 30, 2012
会议地点Beijing, China
关键词Clocks Cryptography Security of data Shift registers Table lookup
页码294-310
中文摘要In this paper, we propose a new key recovery attack against irregularly clocked keystream generators, using the approach of time-memory-data trade-offs. The main idea behind our attack is creating several look-up tables and finally recovering the initial states of LFSR d and LFSR c synchronously, by alternatively deriving the initial states of LFSR d and LFSR c along the chains. We show that our attack is more efficient, and improves the previous attacks on the cipher model. Especially, we prove that our attack almost always needs less complexity than that of the normal time-memory-data trade-off attack [3] on the cipher model. We test our attack on LILI-128, and find out that it can successfully break the cipher with 256.6 bit-comparison operations, 249 pairs of 89-bit words memory and 259 keystream bits. This result is better than those in [15,6], which possess the complexity of 262 parity checks and 2 63 bit operations respectively. Moreover, our attack can be divided and computed in parallel, and the actual runtime of the attack can be reduced depending on the number of computers we access. © 2013 Springer-Verlag Berlin Heidelberg.
英文摘要In this paper, we propose a new key recovery attack against irregularly clocked keystream generators, using the approach of time-memory-data trade-offs. The main idea behind our attack is creating several look-up tables and finally recovering the initial states of LFSR d and LFSR c synchronously, by alternatively deriving the initial states of LFSR d and LFSR c along the chains. We show that our attack is more efficient, and improves the previous attacks on the cipher model. Especially, we prove that our attack almost always needs less complexity than that of the normal time-memory-data trade-off attack [3] on the cipher model. We test our attack on LILI-128, and find out that it can successfully break the cipher with 256.6 bit-comparison operations, 249 pairs of 89-bit words memory and 259 keystream bits. This result is better than those in [15,6], which possess the complexity of 262 parity checks and 2 63 bit operations respectively. Moreover, our attack can be divided and computed in parallel, and the actual runtime of the attack can be reduced depending on the number of computers we access. © 2013 Springer-Verlag Berlin Heidelberg.
收录类别EI
会议录Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
语种英语
ISSN号0302-9743
ISBN号9783642385186
源URL[http://ir.iscas.ac.cn/handle/311060/15977]  
专题软件研究所_软件所图书馆_会议论文
推荐引用方式
GB/T 7714		 Jiao Lin,Wang Mingsheng,Zhang Bin,et al. an improved time-memory-data trade-off attack against irregularly clocked and filtered keystream generators[C]. 见:8th China International Conference on Information Security and Cryptology, INSCRYPT 2012. Beijing, China. November 28, 2012 - November 30, 2012.

入库方式： OAI收割

来源：软件研究所

浏览0
下载0
收藏0
其他版本

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。