| an improved time-memory-data trade-off attack against irregularly clocked and filtered keystream generators |
| Jiao Lin; Wang Mingsheng; Zhang Bin; Li Yongqiang
|
| 2013
|
| Conference Name | 8th China International Conference on Information Security and Cryptology, INSCRYPT 2012
|
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
|
| Pages | 294-310
|
| Conference Date | November 28, 2012 - November 30, 2012
|
| Conference Place | Beijing, China
|
| Indexed Type | EI
|
| ISSN | 0302-9743
|
| ISBN | 9783642385186
|
| Department | (1) Institute of Software Chinese Academy of Sciences Beijing 100190 China; (2) Graduate University of Chinese Academy of Sciences Beijing 100049 China; (3) State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China
|
| English Abstract | 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. |
| Keyword | Clocks
Cryptography
Security Of Data
Shift Registers
Table Lookup
|
| Language | 英语
|
| Content Type | 会议论文
|
| URI | http://ir.iscas.ac.cn/handle/311060/15977
|
| Collection | 中国科学院软件研究所
|
Recommended Citation
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],2013:294-310.
|
| Files in This Item: |
|
There are no files associated with this item. |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment