Improved Cryptanalysis of the Common Scrambling Algorithm Stream Cipher

作者: Leonie Simpson , Matt Henricksen , Wun-She Yap

DOI: 10.1007/978-3-642-02620-1_8

关键词:

摘要: This paper provides a fresh analysis of the widely-used Common Scrambling Algorithm stream cipher (CSA-SC). Firstly, new representation CSA-SC with state size only 89 bits is given, significant reduction from 103 bit previous representation. Analysis this 89-bit demonstrates that basis guess-and-determine attack flawed. Correcting flaw increases complexity so it worse than exhaustive key search. Although not feasible, reduced our makes obvious vulnerable to several generic attacks, for which feasible parameters are given.

参考文章(7)
Ralf-Philipp Weinmann, Kai Wirt, Analysis of the {DVB} Common Scrambling Algorithm communications and multimedia security. pp. 195- 207 ,(2005) , 10.1007/0-387-24486-7_15
Robert W. Floyd, Non-deterministic algorithms ,(1966)
Jin Hong, Palash Sarkar, New Applications of Time Memory Data Tradeoffs Lecture Notes in Computer Science. pp. 353- 372 ,(2005) , 10.1007/11593447_19
Christian Kraetzer, Claus Vielhauer, Jana Dittmann, Bart De Decker, Communications and Multimedia Security ,(2008)
Robert W. Floyd, Nondeterministic Algorithms Journal of the ACM. ,vol. 14, pp. 636- 644 ,(1967) , 10.1145/321420.321422
Fast computation of large distributions and its cryptographic applications Lecture Notes in Computer Science. ,vol. 3788, pp. 313- 332 ,(2005) , 10.1007/11593447