Reference no: EM132399800
INFO8600 Fundamentals of Cryptography - Conestoga College - Stream Ciphers
Question 1: What RC4 key value will leave S unchanged during initialization? That is, after the initial permutation of S, the entries of S will be equal to the values from 0 through 255 in ascending order.
Question 2: a) What is the maximum period obtainable from the following generator?
Xn+1 = (aXn)mod24
b) What should be the value of a?
c) What restrictions are required on the seed?
Question 3: In this problem we will study LFSRs in somewhat more detail. LFSRs come in three flavors:
a. LFSRs which generate a maximum-length sequence. These LFSRs are based onprimitive polynomials.
b. LFSRs which do not generate a maximum-length sequence but whose sequence length is independent of the initial value of the register. These LFSRs are based on irreducible polynomials which are not primitive. Note that all primitive polynomialsare also irreducible.
c. LFSRs which do not generate a maximum-length sequence and whose sequence length depends on the initial values of the register. These LFSRs are based onreducible polynomials. We will study examples in the following. Determine all sequences generated by:
x^4 + x^2+1
x^4 +x+1
x^4 ?+ x?^3+ x^2+x+1
Draw the corresponding LFSR for each of the three polynomials (highest degree is the tap from the right most cell). Which of the polynomialsis primitive, which is only irreducible, and which one is reducible? Note that thelengths of all sequences generated by a given LFSR should add up to 2^m-1(excludingthe all zero sequence.)