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 bits from the shift register to create a key stream. The nonlinear combiner generator employs several (LFSRs) and a Boolean function that combines bit from all the registers to generate the key stream. A new attack on the filter generator has recently been described by Rønjom ...

In this paper, we present a correlation attack on Sosemanuk with complexity less than 2. Sosemanuk is a software oriented stream cipher proposed by Berbain et al. to the eSTREAM call for stream cipher and has been selected in the final portfolio. Sosemanuk consists of a linear feedback shift register(LFSR) of ten 32-bit words and a finite state machine(FSM) of two 32-bit words. By combining lin...

A Linear Feedback Shift Register, or LFSR, can implement an event counter by shifting whenever an event occurs. A single two-input exclusive-OR gate is often the only additional hardware necessary to allow a shift register to generate, by successive shifts, all of its possible nonzero values. The counting application requires that the number of shifts be recoverable from the LFSR contents so th...

This paper presents a byte-oriented stream cipher – Loiss, which takes a 128-bit initial key and a 128-bit initial vector as inputs, and outputs a key stream of bytes. The algorithm is based on a linear feedback shift register, and uses a structure called BOMM in the filter generator, which has good property on resisting against algebraic attacks, linear distinguishing attacks and fast correlat...

An algorithm is derived for inferring a binary vector s given noisy observations of Asmodulo2, where A is a binary matrix. The binary vector is replaced by a vector of probabilities, optimized by free energy minimization. Experiments on the inference of the state of a linear feedback shift register indicate that this algorithm supersedes Meier and Staaelbach's polynomial algorithm. (As + n) mod...