In 2002, Mita et al.[1] proposed a pseudorandom bit generator based on a dynamic linear
feedback shift register (DLFSR) for cryptographic application. The particular topology there …

The output sequence of the shrinking generator can be considered as an interleaving of
determined shifted versions of a single PN-sequence. In this paper, we present a study of …

This work shows that the cryptanalysis of the shrinking generator requires fewer intercepted
bits than that indicated by the linear complexity. Indeed, whereas the linear complexity of …

The shrinking generator is a simple keystream generator with applications in stream ciphers,
which is still considered as a secure generator. This work shows that, in order to …

We study cryptographic properties such as correlation, correlation measure and linear
complexity profile of the sequences defined by characters with interleaved structure …

Some pseudorandom sequences with good crytographic features can be obtained from the
interleaving of other families of sequences with unsuitable properties. PN-sequences …

In this paper, we propose a simple method to build an interleaved sequence on, 2 F based
on the left-shifted and decimation functions and introduce indexing functions to build such a …

The shrinking generator is a very popular sequence generator with cryptographic
applications. Nowadays, it is still considered as a secure keystream generator. In this work, it …

The output sequence of the shrinking generator can be considered as an interleaving of
determined shifted versions of a single PN-sequence. In this paper, we present a study of …

Let s be an m-sequence of period N and m be such that 2≤ m≤ N-1. Let fm (x, y)=(mx+(m-
1) mod mN be a twovariable function defined from ZN x Z*< sub> m+ 1 into Z< sub> mN. In …