In this letter, we show that a differentially encoded maximal-length shift register sequence (or M-sequence) is also an M-sequence or the logical complement of an M-sequence. The differentially encoded sequence is a cyclically shifted version of the original M-sequence or its complement.

Scan and ring schemes of the pseudo-ring memory selftesting are investigated. Both schemes are based on emulation of the linear or nonlinear feedback shift register by memory itself. Peculiarities of the pseudo-ring schemes implementation for multi-port and embedded memories, and for register file are described. It is shown that only small additional logic is required and allows microcontroller...

A common approach to protect confidential information is to use a stream cipher which combines plain text bits with a pseudo-random bit sequence. Among the existing stream ciphers, Non-Linear Feedback Shift Register (NLFSR)based ones provide the best trade-off between cryptographic security and hardware efficiency. In this paper, we show how to further improve the hardware efficiency of Grain s...

We give a polynomial time algorithm for computing the Igusa local zeta function Z(s, f) attached to a polynomial f(x) ∈ Z[x], in one variable, with splitting field Q, and a prime number p. We also propose a new class of linear feedback shift registers based on the computation of Igusa’s local zeta function.

Nonlinear filter generators are common components used in the keystream generators for stream ciphers and more recently for authentication mechanisms. They consist of a Linear Feedback Shift Register (LFSR) and a nonlinear Boolean function to mask the linearity of the LFSR output. Properties of the output of a nonlinear filter are not well studied. Anderson noted that the m-tuple output of a no...

Clock control is one of the mechanisms employed to introduce non-linearity into key stream generators built from linear feedback shift registers. The earliest devices were built from stop-and-go registers while the most recent example, the Shrinking Generator proposed in [2], has an irregular clocking scheme where the number of steps between successive outputs is linked to the length of zero-ru...

A method for the determination of all cycles of deterministic finite state automata is presented. Using a finite field description GF(2) these automata are shown to correspond to multilinear state equations. Basic results from feedback shift register theory are recalled and developed towards a complete analysis tool for affine-linear automata. The multilinear case is reduced to the affine-linea...

We develop a new approach to perform hardware validation by the formal veriication methodology and apply it to a bidirectional serial/parallel shift register. In such process, the formalism Evolving Algebras is used and its great simplicity in modelling the temporal evolution of real systems is stressed.

We describe a solution for physically obfuscating the representation of a cipher, to augment chips resistance against physical threats, by combining ideas from masking techniques and Physical Obfuscated Keys (POKs). With embedded chips – like RFID tags – as main motivation, we apply this strategy to the representation of a Linear Feedback Shift Register (LFSR). The application of this technique...

Delft In this paper the problem of finding the absolutely shortest (possibly nonlinear) feedback shift register, which can generate a given sequence with characters from some arbitrary finite alphabet, is considered. To this end, a new complexity measure is defined, called the maximum order complexity. A new theory of the nonlinear feedback shift register is developed, concerning elementary com...