It is shown in this paper that the iterative algorithm introduced by Berlekamp for decoding BCH codes actually provides a general solution to the problem of synthesizing the shortest linear feedback shift register capable of generating a prescribed finite sequence of digits. The shit-register approach leads to a simple proof of the validity of the algorithm as well as providing additional insig...

Linear Consistency Test (LCT) is a well-known algebraic method of cryptanalysis of stream ciphers. In this paper, we use LCT in an attack on a noised irregularly clocked linear feedback shift register (LFSR). We show that it is possible to reconstruct the initial states of both the clocked and the clocking LFSR in this scheme by using an essentially algebraic attack method, such as LCT, as a bu...

Signature analysis is an important compact method in digital testing. Applying this method, a test response sequence of a device under test is compressed by a linear feedback shift register (LFSR, for short). Masking occurs if a faulty device yields the same signature as the corresponding good device. Due to the linearity of any LFSR, this happens if and only if the 'error sequence' which is ob...

Pseudorandom binary sequences are widely applied to the various engineering domains such as biology system control, spread spectrum communications and cryptography [1-3]. Particularly, the security of cryptographic systems is strongly contingent on the pseudorandomness of the key stream [3]. Depending on the cryptography application, a sequence is required to present many properties so as to be...

We consider the filter generator over GF (2) consisting of a linear feedback shift register of length k that generates a maximal length linear sequence of period 2 − 1 over GF (2) and a Boolean function of degree d that combines bits from one element in the shift register (considered as an element in GF (2)) and creates a binary output bit zt at any time t. We show how to extend a recent attack...

Linear feedback shift registers (LFSRs) and nonlinear feedback shift registers (NLFSRs) are major components of stream ciphers. It has been shown that, under certain idealized assumptions, LFSRs and LFSR-based stream ciphers are susceptible to cryptanalysis using simple power analysis (SPA). In this paper, we show that simple power analysis can be practically applied to a CMOS digital hardware ...

A modified Linear Feedback Shift Register is designed in which power consumption reduction by deactivating the clock signal to Flip Flop when the output signal is same as input signal. The power consumption of the new LFSR is reduced due to the reduced switching of Flip Flop To verify, the maximum, minimum and average

Non-linear feedback shift registers are widely used in lightweight cryptographic primitives. For such constructions we propose a general analysis technique based on differential cryptanalysis. The essential idea is to identify conditions on the internal state to obtain a deterministic differential characteristic for a large number of rounds. Depending on whether these conditions involve public ...

This work presents a 24 Gb/s pseudo random bit sequence (PRBS) generator with a sequence length of 2 − 1 . The circuit uses an interleaved linear feedback shift register and multiplexing architecture. An output voltage swing of 280 mVpp is achieved for 24 Gb/s data rate and 390 mVpp for 10 Gb/s. The circuit features a trigger output which allows to trigger the eye or the sequence pattern. The c...

An efficient low power built-in self-test methodology based on linear feedback shift register reseeding is proposed. This new method divides each test cube into several blocks and encodes that cube into a new test cube. In the new encoded test cube, the nontransitional blocks which no specified bits is included or only one kind of specified bit (1 or 0) is encoded into only one bit (1, 0, or X)...