Linear Feedback Shift Register, a pseudorandom bit generator which can be efficiently implemented in hardware.
3
votes
1answer
208 views
LFSR dynamic mutation
In normal LFSR, the state is a function of the initial seed, taps positions and time, nothing else. I've seen a modification of LFSR that works like this:
...
2
votes
2answers
138 views
Number of states in a LFSR
Do all $2^{\ell}$ (where $\ell$ is the bit length of the shift register) states always occur in a LFSR or can I choose my taps badly so some states are skipped and the period is shortened?
If so is ...
2
votes
2answers
189 views
Berlekamp-Massey algorithm: case when sequence length is less than double the length of the LFSR
Suppose that we have a sequence of $N$ digits which is produced by a Linear Feedback Shift Register (LFSR) and the shortest such LFSR is of length $L$. A very important tool in cryptanalysis of stream ...
2
votes
2answers
460 views
Cryptanalysis of Linear Feedback Shift Registers
It is well known that simple m-sequence linear feedback shift registers have a linear algebraic structure and therefore the generator seed can easily be deduced using the Berlekamp-Massey algorithm. ...
2
votes
1answer
296 views
Linear Feedback Shift Register Taps
Linear feedback shift register tap charts are availale for registers of length 3 to 168. Does anyone have a chart for register lengths from 168 to 256 or beyond? Thank you.
1
vote
2answers
117 views
Combining LFSRs for Stream Ciphers: Why do we need high non-linearity?
Linear Feedback Shift Registers (LFSRs) can be excellent (efficient, fast, and with good statistial properties) pseudo-random generators. Many stream ciphers are based on LFSRs and one of the possible ...
