The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Beth and Dai studied in their Eurocrypt paper [1] the relationship between linear complexity (that is, the length of the shortest Linear Feedback Shift Register that generates the given strings) of strings and the Kolmogorov complexity of strings. Though their results are correct, some of their proofs are incorrect. In this note, we demonstrate with a counterexample the reason why their proofs are...
In [7], perfect multi-sequences are introduced and a construction based on function fields over finite fields is given. In this paper, we explore the construction in [7] by considering rational function fields. Consequently a class of perfect multi-sequences are obtained.
This paper proposes an approach for the cryptanalysis of stream ciphers where the encryption is performed by multiple linear feedback shift registers (LFSR) combined by a nonlinear function. The attack assumes no knowledge of either the LFSR initial conditions or the combining function. Thus, the actual architecture of the encryption system can be arbitrary. The attack is also generalized for the...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.