![]() ![]() In all cases, we demonstrate that the degree of a functional relationship between the registers can be bounded by two. In the other two situations, we do better than or as well as all attacks but the correlation attack. In the case of the strengthened stop-and-go generator and of the self-decimated generator, we obtain the initial state of the registers in a significantly faster time than any other known attack. We then apply this general theory to four specific stream ciphers: the (strengthened) stop-and-go generator, the alternating step generator, the self-decimated generator and the step1/step2 generator. ![]() In the general set-up, we assume that the output bit of one shift register controls the clocking of other registers in the system and produces a family of equations relating the output bits to the internal state bits. We present an algebraic attack approach to a family of irregularly clock-controlled bit-based linear feedback shift register systems. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |