Many bitstream generators are based on linear feedback shift registers. A widespread technique for the cryptanalysis of those generators is the linear consistency test (LCT). In this paper, we consider an application of the LCT in cryptanalysis of clock-controlled bitstream generators, called clock control guessing. We give a general and very simple method for estimating the efficiency of clock control guessing, yielding an upper bound on the effective key length of a whole group of bitstream generators. Finally, we apply the technique against a number of clock-controlled generators, such as the A5/1, alternating step generator, step1-step2 generator, cascade generator, and others. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Zenner, E. (2003). On the efficiency of the clock control guessing attack. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2587, 200–212. https://doi.org/10.1007/3-540-36552-4_14
Mendeley helps you to discover research relevant for your work.