In high-performance processors, the accuracy of branch prediction plays a significant role in enhancing computer execution. A new hardware approach is presented in this paper to dynamically predict branch directions using path information. As an execution path contains large information, we compress the large information using a technique based on the linear feedback shift register (LFSR) that ...

A stream cipher is a symmetric cipher which operates with a time-varying transformation on individual plaintext digits. By contrast, block ciphers operate with a fixed transformation on large blocks of plaintext digits. More precisely, in a stream cipher a sequence of plaintext digits, m0m1 . . ., is encrypted into a sequence of ciphertext digits c0c1 . . . as follows: a pseudorandom sequence s...

Feedback Shift Register (FSR) sequences have been successfully implemented in many communication systems for their randomness properties and ease of implementation. These include ranging and navigation systems, spread spectrum communication systems, CDMA mobile communication systems, and crypto systems such as streamciphers. This article gives a brief overview of FSR sequences, both linear and ...

In this paper, we present a new pseudo-random sequence generator, constructed by the generalized discrete Baker transformation. This new generator is called Cascaded Baker Register Machine (CBRM), which uses the sensitivity of chaotic behaviour and allows the application of automataand shift-register theory. It is shown that a CBRM has good properties of randomness, such as large periods and hi...

Pseudo-random sequences are essential ingredients of every modern digital communication system including cellular telephones, GPS, secure internet transactions, and satellite imagery. Each application requires pseudo-random sequences with specific statistical properties. This book describes the design, mathematical analysis, and implementation of pseudo-random sequences, particularly those gene...

In this paper, we study sequences generated by arbitrary feedback registers (not necessarily feedback shift registers) with arbitrary feedforward functions. We generalize the definition of linear complexity of a sequence to the notions of strong and weak linear complexity of feedback registers. A technique for finding upper bounds for the strong linear complexities of such registers is develope...

Fredricksen, H., A new look at the de Bruijn graph, Discrete Applied Mathematics 37138 (1992) 193-203. The Good-de Bruijn graph was originally defined to settle a question of existence of a certain shift register sequence, namely a binary cycle of length 2” containing each of the different binary n-tuples. The further properties of the graph have been studied by several authors. Because the gra...

Maximal length Feedback with Carry Shift Register sequences have several remarkable statistical properties. Among them is the property that the arithmetic correlations between any two cyclically distinct decimations are precisely zero. It is open, however, whether all such pairs of decimations are indeed cyclically distinct. In this paper we show that the set of distinct decimations is large an...

A novel algorithmic approach to the synthesis of fairly long DNA molecules with nonrecurring sequences is demonstrated. The scheme exploits chemical embodiment of shift registers (SR) to execute algorithms similar to those used to generate pseudorandom numbers on a computer. Single stranded DNA molecules guide the synthesis of double stranded DNA according to the SR truth table. The SR logic fa...