Assignment | Hand-out Date | Due Date | Worth |
---|---|---|---|
1 | Jan. 28 | Feb. 25 | 20% |
2 | Mar. 4 | Apr. 1 | 20% |
In addition to the two assignments, there will be an Assignment 0
(not to be handed in) for students that need practice in finite
fields. It will be distributed on the first week of classes.
Moreover, there will be a project (60%) formed by three oral presentations (5%, 10% and 15%, respectively) and a written project (30%). The list of possible topics for the project will be distributed in late January. Students must pick a topic by Thursday February 4. The project marks are formed by: (1) a 10-15 minutes introductory to the project talk on Thursday March 11; (2) a 15-20 minutes middle advances on the project second talk on Thursday March 25; (3) a third final 25-30 minutes presentation on the project on Thursday April 8; and (4) a written 15-20 pages project due on Tuesday April 13.
WEEK |
DATES |
LECTURES |
REMARKS |
1 |
Jan. 12-14 | Introduction to the course. Sequences over finite fields and applications. Finite fields revision. | Finite fields exercises distributed. |
2 |
Jan. 19-21 | Feedback shift registers and linear feedback shift registers. Examples. LFSR: periodic properties; polynomial view. | List of projects distributed. |
3 |
Jan. 26-28 | LFSR: minimal polynomials and periods; irreducible decomposition. | Assignment 1 handed out. |
4 |
Feb. 2-4 | LFSR: reducible decomposition; matrix representation. | Projects decided this week. |
5 |
Feb. 9-11 | Traces representation. Decimation. Revision of LFSR theory. Randomness criteria. Golomb's postulates for binary sequences. | |
- |
Feb. 16-18 | Reading week |
|
6 |
Feb. 23-25 | Golomb's postulates for q-ary sequences. Short introduction to characters. Randomness of m-sequences. Applications to random generators and stream ciphers. | Assignment 1 due. |
7 |
Mar. 2-4 | Discrete Fourier transform of periodic sequences. Trace representation of periodic sequences and DFT. DFT and linear span of a sequence. | Assignment 2 handed out. |
8 |
Mar. 9-11 | Student presentations #1. | |
9
|
Mar. 16-18 | Berlekamp-Massey algorithm. | |
10 |
Mar. 23-25 | Student presentations #2. | |
11 |
Mar. 30 - Apr. 1 | Finite fields functions and sequences in cryptography. | Assignment 2 due. |
12 |
Apr. 6-8 | Final project presentations #3. | Final project due Tuesday April 13. |