Chapter 2: Problem 7 Previous Problem Problem List Next Problem (1 point) Note: The notation from this problem is from Understanding Cryptography by Paar and Pelzl We conduct a known-plaintext attack against an LFSR. Through trial and error we have determined that the number of states is m = 4 The plaintext given by m 01100110 CO21222324252627 when encrypted by the LFSR produced the ciphertext 10101010 = yoyi Y2Y3Y3Y5Y697 What are the tap bits of the LFSR? Please enter your answer as unspaced binary digits (eg 0101 to represent P3 0,P2 = 1, P1 = 0, po = 1)