The development of display scan drivers is an essential step in the effort to develop transparent and flexible display devices based on nanowire transistors. Here we report a transparent nanowire-based shift register that functions as the standard logic circuit of a display scan driver. To form the shift register circuits using only n-type nanowire transistors, a novel circuit structure was int...

The recently developed algebraic attacks apply to all keystream generators whose internal state is updated by a linear transition function, including LFSR-based generators. Here, we describe this type of attacks and we present some open problems related to their complexity. We also investigate the design criteria which may guarantee a high resistance to algebraic attacks for keystream generator...

Reversible logic will be a favourable logic by dissipating less heat than the thermo dynamic limit for the emerging computing technologies. Also it has become very promising for low power designs. Reversible designs of Combinational and Sequential circuits are built by replacing the latches, flip-flops and associated combinational gates of the traditional irreversible designs by their reversibl...

We study the ability of linear recurrent networks obeying discrete time dynamics to store long temporal sequences that are retrievable from the instantaneous state of the network. We calculate this temporal memory capacity for both distributed shift register and random orthogonal connectivity matrices. We show that the memory capacity of these networks scales with system size.

The problem of finding the shortest linear shiftregister capable of generating t finite length sequences over some field F is considered. A similar problem was already addressed by Feng and Tzeng. They presented an iterative algorithm for solving this multi-sequence shift-register synthesis problem, which can be considered as generalization of the well known Berlekamp– Massey algorithm. The Fen...

Non-Linear Feedback Shift Registers (NLFSRs) are a generalization of Linear Feedback Shift Registers (LFSRs) in which a current state is a nonlinear function of the previous state. While the theory behind LFSRs is wellunderstood, many fundamental problems related to NLFSRs remain open. Probably the most important one is finding a systematic procedure for constructing NLFSRs with a guaranteed lo...

The construction of shortest feedback shift registers for a finite sequence S1, . . . , SN is considered over the finite ring Zpr . A novel algorithm is presented that yields a parametrization of all shortest feedback shift registers for the sequence of numbers S1, . . . , SN , thus solving an open problem in the literature. The algorithm iteratively processes each number, starting with S1, and...

Grain and Trivium are the hardware-oriented finalists of the eSTREAM. They are both based on nonlinear feedback shift registers. In this paper, we study their generalized classes of nonlinear feedback shift registers with time varying feedback functions, namely, Grain-like and Trivium-like structures. Some interesting results regarding their periods are obtained.

Sfinks is a shift register based stream cipher designed for hardware implementation. The initialisation state update function is different from the state update function used for keystream generation. We demonstrate state convergence during the initialisation process, even though the individual components used in the initialisation are one-to-one. However, the combination of these components is...

A register that is designed to allow the bits of its contents to be moved to left or right is known to be a shift register. Shift registers may be implemented by using pulsed latches and flip flops.However,shift register implemented by pulsed latches have power and area problems .So, flip flops are preferred over pulsed latches. In this paper, a VLSI architecture for low power area efficient VL...