Issue No. 04 - April (1996 vol. 45)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.494106
<p><b>Abstract</b>—A concept of constrained many-to-one string edit distances, with or without memory, based on edit operations of deletion and substitution is introduced, and the recursive algorithms for their efficient computation are derived. Their use for correlation attacks on clock-controlled shift register based keystream generators is proposed, the divide and conquer effect is examined, and the generalized reducibility property of functions with memory is pointed out as a design criterion.</p>
Clock-controlled shift registers, constrained edit distances, correlation attacks, keystream generators.
S. V. Petrovic and J. D. Golic, "Correlation Attacks on Clock-Controlled Shift Registers in Keystream Generators," in IEEE Transactions on Computers, vol. 45, no. , pp. 482-486, 1996.