An LFSR that can generate all possible combinations of binary states is called primitive LFSR. For instance, if we have a primitive LFSR with degree m=6, it means that LFSR should generate (261) bits binary data.

a.Design a Pseudo-random number generator circuit with a degree m=4 using LFSR.

b.Assuming initial seed 1001, tabulate all binary states.

c.The LSB of the LFSR is used for stream cipher key generation. What is the cipher-text for the following plaintext: 101001111000111?

Note:you can follow any direction you want but for simplicity consider the plaintext is being injected into the stream cipher from LSB to MSB, that is LSB goes first.