Cryptanalysis of LFSR-encrypted codes with unknown combining function

2Citations
Citations of this article
33Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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 situation when the combining function is correlation immune of any particular order. This is in direct contrast with the existing methods which depend heavily not only on the correlation between the output of a particular LFSR and the ciphertext but also on the actual configuration of the encryption system used. Thus, the proposed method is the first ciphertext only attack in the true sense of the phrase. The paper also gives theoretical estimates of the cipherlengths involved in the determination of the initial conditions as well as estimation of the combining function.

Cite

CITATION STYLE

APA

Palit, S., & Roy, B. K. (1999). Cryptanalysis of LFSR-encrypted codes with unknown combining function. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1716, pp. 1–15). Springer Verlag. https://doi.org/10.1007/978-3-540-48000-6_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free