Question: We conduct a known-plaintext attack against an LFSR. Through trial and error we have determined that the number of states is = 4. The plaintext

We conduct a known-plaintext attack against an LFSR. Through trial and error we have determined that the number of states is = 4. The plaintext given by m = 11001011 = xox1x2x3X4X5X6X7 when encrypted by the LFSR produced the ciphertext 10111101 = yo Yi Y2 Y3 Y3 Y5 Y6 Y7. What are the tap bits of the LFSR? Please enter your answer as unspaced binary digits (e.g. 0101 to represent P3 = 0, P2 = 1, p1 = 0, po = 1). 0010
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
