The answer above is NOT correct. 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...

Extracted text: The answer above is NOT correct. 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 11100010 — ХоXјX2XҙX4XsX6X7 when encrypted by the LFSR produced the ciphertext 11010110 — Уo У1 У2 Уз Уз У5 У6 Ут. 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