1999•IEEE Transactions on Information TheoryRequires access

The linear complexity of the self-shrinking generator

Simon R. Blackburn⋆

Abstract

The self-shrinking generator, a stream cipher due to Meier and Staffelbach (see Advances in Cryptology-EUROCRYPT'94, Berlin, Germany, p.205-14, 1995 and Lecture Notes in Computer Science, vol.950), uses the output of a primitive binary linear-feedback shift register (LFSR) of length n to generate a keystream sequence of period dividing 2/sup n-1/. The article proves that the linear complexity of the keystream is at most 2/sup n-1/-(n-2). This confirms the surprising experimental observations of Meier and Staffelbach.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 43 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Stream cipher, Keystream, Self-shrinking generator, Shift register, Linear feedback shift register, Cryptography, Generator (circuit theory), Sequence (biology)