A simple attack on some clock-controlled generators
Computers & Mathematics with Applications
Encryption System with Variable Number of Registers
Computers and Electrical Engineering
Reduced complexity attacks on the alternating step generator
SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
| Hi-index | 754.84 |
The edit distance correlation attack on the well- known alternating step generator for stream cipher applications was proposed by Golic and Menicocci. The attack can be successful only if the probability of the zero edit distance, the so-called embedding probability, conditioned on a given segment of the output sequence, decreases with the segment length, and if the decrease is exponential, then the required segment length is linear in the total length of the two linear feedback shift registers involved. The exponential decrease for the maximal value of the embedding probability, regarded as a function of the output segment, was estimated experimentally by Golic and Menicocci. In this paper, by using the connection with the interleaving and decimation operations, the embedding probability is analyzed theoretically. Exponentially small upper bounds on the maximal embedding probability are thus derived. An exact expression for the minimal embedding probability is also determined