Skip to main content
Conference ProceedingsOPEN ACCESS

Cryptanalysts Representation of Nonlinearly Filtered ML-Sequences

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1986) 219 LNCS 103-110
DOI: 10.1007/3-540-39805-8_12
41Citations
Citations of this article
36Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A running key generator consisting of a maximum-length (ML) linear feedback shift register (LFSR) and some nonlinear feedforward state filter function is investigated. It is shown how a cryptanalyst can find an equivalent system in a ciphertext-only attack. The analysis uses a Walsh orthogonal expansion of the state filter function and its relation to the crosscorrelation function (CCF) between the ML-sequence and the produced running key sequence.

Cite

CITATION STYLE

APA

Siegenthaler, T. (1986). Cryptanalysts Representation of Nonlinearly Filtered ML-Sequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 219 LNCS, pp. 103–110). Springer Verlag. https://doi.org/10.1007/3-540-39805-8_12

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