amework Sels Chapter 2 Problem User Settings Grades Problems Chapter 2: Problem 8 Previous Problem Problem List Next Prob (1 point) Note. The notabon Dom this problem is bom Understanding Cryptography by Par and Pet th ALFSR with intestato bits is said to be of maximal length if any seed state (except 0) produces an output stream which periodic with the macmal period 2-1 Recal a primitive polynomial consponds to a maximum length LFSR Pretive polynomials are a special case of medicble polynomials (roughly polynomian that context of LFSRs a polynomial is meducible if every seed state (except zero) gives an LFSR with the same penod (though the period length may not be msoma) We wil cada polynomial with neither of these properter composte Pro Pri Classify the following polynomials as other pemetve meducible, or composte by sting ether PI or C in the coresponding answer bank below Problem 3 Problem 5 Problem 6 Proble Problem It get et 19 ++1 Note: You can earn paral creat on this prob Preview My Answers Submit Answers You have attempted the problem 0 times You have united attempts remaining