(1 point) Note: The notation from this problem is from Understanding Cryptography by Paar and Pelzl.

Suppose you have an LFSR with 6 state bits. The first 12 bits of output produced by this LFSR are

101100001110=s0s1s2s3s4s5s6s7s8s9s10s11.

The first bit produced is the leftmost bit and the bit most recently produced is the rightmost bit.

a) What is the initial state of the LFSR? Please enter your answer as unspaced binary digits (e.g. 010101 to represent s5=0,s4=1,s3=0,s2=1,s1=0,s0=1).

b) What are the tap bits of the LFSR? Please enter your answer as unspaced binary digits (e.g. 010101 to represent p5=0,p4=1,p3=0,p2=1,p1=0,p0=1).

Chapter 2: Problem 4 Previous Problem Problem List Next Problem (1 point) Note: The notation from this problem is from Understanding Cryptography by Paar and Pelzl. Suppose you have an LFSR with 6 state bits. The first 12 bits of output produced by this LFSR are 101100001110 = so S1 S2 S3 S4 S5 S6 S7 S8 S9 S10 S11. The first bit produced is the leftmost bit and the bit most recently produced is the rightmost bit. a) What is the initial state of the LFSR? Please enter your answer as unspaced binary digits (e.g. 010101 to represent s5 = 0, $4 = 1, s3 = 0, $2 = 1, s = 0, so = 1). = = = = = b) What are the tap bits of the LFSR? Please enter your answer as unspaced binary digits (e.g. 010101 to represent p5 = 0, P4 = 1, P3 = 0, P2 = 1, P1 = 0, po = 1). =