Accelerated brute force attack on sequential cipher systems on LFSR

Algebraic attack is an emergent decryption method. the main objective in this decryption is to form and solve a set of multivariate polynomial equations on finite fields. the present findings show that algebraic attacks have been significantly successful and effective on a specific type of stream ciphers system and linear-feedback shift register systems (lfsrs). one of the reasons for this is that linear functions are used for updating lfsrs, although the nonlinear types can also be approximated by an appropriate linear function, and this increases the necessity of paying attention to it. in the present article, an attempt is made to present the main idea of algebraic attacks on stream ciphers systems, and to explain these ideas by certain concrete examples. particularly, a synchronous stream cipher system based on lfsrs, entitled the lili stream ciphers, and algebraic attacks on them, will be discussed. in this research, the extended linearization algorithm (xl) will be used to deal with an attained set of equations. additionally, some of the accelerated extended algorithms (xl) for dealing with the set of equations algebraic resulted from the attacks on stream cipher systems, will be analyzed and their efficiency will be examined in the frame of certain examples.