The linear complexity and autocorrelation values are very important measures for evaluating the randomness of sequences. The engineering interpretation of linear complexity (LC) is as the length of the shortest linear feedback shift register (LFSR) that generates the sequence. By BerlekampMassey algorithm, if the linear complexity of a key stream is L, then 2L consecutive characters of the sequ...

A neutron coincidence module was designed using multistage shift registers to produce the coincidence gates 3nd a crystal controlled oscillator with variable clock outputs to change the gate lengths. The advantage of this system over the conventional, thermal-neutron coincidence gates is a decrease in deadtime by more than an order of magnitude.

The linear complexity and the k-error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By using the sieve method of combinatorics, the k-error linear complexity distribution of 2-periodic binary sequences is investigated based on Games-Chan algorithm. First, for k = 2, 3, the complete countin...

The linear complexity and the k-error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By studying the linear complexity of binary sequences with period 2n, one could convert the computation of kerror linear complexity into finding error sequences with minimal Hamming weight. Based on Games-C...

In this paper, we focus on analyzing the period distribution of the inversive pseudorandom number generators (IPRNGs) over finite field (ZN ,+,×), where N > 3 is a prime. The sequences generated by the IPRNGs are transformed to 2-dimensional linear feedback shift register (LFSR) sequences. By employing the generating function method and the finite field theory, the period distribution is obtain...

Linear feedback shift registers (LFSR’s) are fundamental primitives in the theory and practice of pseudorandom number generation and coding theory (see, e.g., [1], [2], [3], [4], [6], [7], and references therein). Figure 1 describes a typical LFSR over the two-element field F2 = {0, 1}, where each step consists of adding some of the state bits (we follow the convention that the elements of F2 a...

Utilisation of input compatibilities alleviates test costs inmany applications such as reducing linear feedback shift register (LFSR) size, and scan tree construction among others. Correlation among inputs, identified based on a test set analysis, can be exploited by driving the circuit inputs through fewer channels. The reduction in the number of channels, which is dictated by the number of co...

The filter generator consists of a linear feedback shift register (LFSR) and a Boolean filtering function that combines some bits from the shift register to create a key stream. A new attack on the filter generator has recently been described by Rønjom and Helleseth [6]. This paper gives an alternative and extended attack to reconstruct the initial state of the LFSR using the underlying subspac...

This paper describes some attacks on word-oriented stream ciphers that use a linear feedback shift register (LFSR) and a non-linear lter. These attacks rely on exploiting linear relationships corresponding to multiples of the connection polynomial that de ne the LFSR.

In 2009, Solé and Zinoviev (Eur. J. Combin., vol. 30, no. 2, pp. 458-467, 2009) proposed an open problem of arithmetic interest to study the period of the inversive pseudorandom number generators (IPRNGs) and to give conditions bearing on a, b to achieve maximal period, we focus on resolving this open problem. In this paper, the period distribution of the IPRNGs over the Galois ring (Zpe ,+,×) ...