Chapter 2: Problem 4 Previous Problem Problem List Next Problem Results for this submission Entered Answer Preview Result 001111 001111 incorrect 101000 101000 incorrect At least one of the answers...

4

Extracted text: Chapter 2: Problem 4 Previous Problem Problem List Next Problem Results for this submission Entered Answer Preview Result 001111 001111 incorrect 101000 101000 incorrect At least one of the answers above is NOT correct. 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 100101011101 = so S1 82 83 S4 S5 S6 57 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 $5 = 0, s4 = 1, s3 = 0, s2 = 1, s1 = 0, so = 1). 001111 b) What are the tap bits of the LFSR? Please enter your answer as unspaced binary digits (e.g. 010101 to represent Ps = 0, p4 = 1, p, = 0, p2 = 1, p = 0, po = 1). 101000