Ortho Linear Feedback Shift Register Cryptographic System

In this article, an encryption algorithm with an error detection technique is presented for highly secured reliable data transmission over unreliable communication channels. In this algorithm, an input data is mapped into orthogonal code first. After that the code is encrypted with the help of Linear Feedback Shift Register (LFSR). The technique has been successfully verified and synthesized using Xilinx by Spartan-3E FPGA. The results show that the error detection rate has been increased to 100% by proposed encryption scheme is effective and improves bandwidth efficiency

A m-ary linear feedback shift register with binary logic

A family of m-ary linear feedback shift registers with binary logic is disclosed. Each m-ary linear feedback shift register with binary logic generates a binary representation of a nonbinary recurring sequence, producible with a m-ary linear feedback shift register without binary logic in which m is greater than 2. The state table of a m-ary linear feedback shift register without binary logic, utilizing sum modulo m feedback, is first tubulated for a given initial state. The entries in the state table are coded in binary and the binary entries are used to set the initial states of the stages of a plurality of binary shift registers. A single feedback logic unit is employed which provides a separate feedback binary digit to each binary register as a function of the states of corresponding stages of the binary registers

Linear Three-Tap Feedback Shift Register-Patent

Linear three-tap feedback shift registe

Pseudonoise sequence generation with three-tap linear feedback shift registers

Pseudonoise sequence generation with three-tap linear feedback shift register

Finding Non-liner Register on Binary M-Sequence Generating Binary Multiplication Sequence

In the current time there is an important problem that is for a received linear or nonlinear binary sequence {zn} how we can find the nonlinear feedback shift register and its linear equivalent which generate this sequence. The linear orthogonal sequences, special M-Sequences, play a big role in these methods for solving this problem. In the current research trying give illuminations about the methods which are very useful for solving this problem under short sequences, and study these methods for finding the nonlinear feedback shift register of a multiplication sequence and its linear equivalent feedback shift register of a received multiplication binary sequence{zn} where the multiplication on h degrees of a binary linear sequence {an}, or finding the equivalent linear feedback shift register of {zn}, where the sequence {zn}of the form M-sequence, and these methods are very effectively. We can extend these methods for the large sequences using programming and modern computers with large memory

Ortho Linear Feedback Shift Register Cryptographic System

In this article, an encryption algorithm with an error detection technique is presented for highly secured reliable data transmission over unreliable communication channels. In this algorithm, an input data is mapped into orthogonal code first. After that the code is encrypted with the help of Linear Feedback Shift Register (LFSR). The technique has been successfully verified and synthesized using Xilinx by Spartan-3E FPGA. The results show that the error detection rate has been increased to 100% by proposed encryption scheme is effective and improves bandwidth efficiency

The Cycle Structure of LFSR with Arbitrary Characteristic Polynomial over Finite Fields

We determine the cycle structure of linear feedback shift register with arbitrary monic characteristic polynomial over any finite field. For each cycle, a method to find a state and a new way to represent the state are proposed.Comment: An extended abstract containing preliminary results was presented at SETA 201

The Pagoda Sequence: a Ramble through Linear Complexity, Number Walls, D0L Sequences, Finite State Automata, and Aperiodic Tilings

We review the concept of the number wall as an alternative to the traditional linear complexity profile (LCP), and sketch the relationship to other topics such as linear feedback shift-register (LFSR) and context-free Lindenmayer (D0L) sequences. A remarkable ternary analogue of the Thue-Morse sequence is introduced having deficiency 2 modulo 3, and this property verified via the re-interpretation of the number wall as an aperiodic plane tiling

Linear Feedback Shift Registers and Cyclic Codes in SAGE

This talk will discuss the history of linear feedback shift registers (LFSR) in cryptographic applications and will attempt to implement an algorithm in SAGE and Python to create a linear feedback shift register sequence (LFSR sequence) in cryptography. Also, this talk will describe an implementation of the Berlekamp-Massey Iterative Algorithm in SAGE and Python. This algorithm will be able to use the Linear Feedback Shift Register sequence generated by the first algorithm to find the sequence\u27s connection polynomial. I will attempt to show that the connection polynomial of a given LFSR sequence is the reverse of a generator polynomial of the cyclic code of length p , where p is also the period of the LFSR sequence. This will provide a connection between cyclic error-correcting codes and LFSR sequences