Vous êtes sur la page 1sur 1

MATH 3815 Cryptography and Cryptanalysis

Fall 2017
Assignment 1
Due date: September 20, 2017

1. Please solve all three problems and upload your solutions to Blackboard.
2. You are encouraged to work in a group, but must solve and submit it individually.

Problem 1 (Paar and Pelzl, p. 26):

Problem 2:
Given the following random number generator LFSR with initialization vector s2 = 0, s1 = 0, and s0 = 1.

Its first 14-bit output (keystream) is ___________________________________

If we used the keystream above to encrypt 7-bit ASCII string hi, what will be the ciphertext?

Problem 3 (Paar and Pelzl, p. 53):


Determine all sequences generated by
1. x4 + x + 1
2. x4 + x2 + 1
3. x4 + x3 + x2 + x + 1
Draw the corresponding LFSR for each of the three polynomials. Which of the polynomials is
primitive? Note that the lengths of all sequences generated by each of the LFSRs should add up
to 2m 1.