|SCIENTIFIC DISCIPLINARY SECTOR||MAT/02|
A large portion of the course will be devoted to the study of the mathematical theory of error-correcting codes, which enable us to control errors in data transmission over unreliable or noisy communication channels. We will also consider family of codes.
In the second part of the course we will turn to Cryptography, the study of mathematical techniques for secure communication. We will introduce classical cryptography, and we will give a general view on modern cryptographic schemes.
Aim of the course is to present to the students the basic topics on Code Theory and Criptography.
Linear algebra and a basic algebra topics (e.g., modular arithmetic, Euclidean algorithm, polynomials, fields).
Lessons and students seminar.
Code Theory: Finite fields, introduction to the problem of error-correction in data transmission, linear codes over finite fields, Hamming distance and minimum distance decoding Singleton and sphere-packing bounds, perfect and MDS codes, Hamming codes and syndrome decoding, codes constructions.
Cryptography: introduction to classical cryptography, some modern cryptographic schemes.
J.H Van Lint - Introduction to coding theory
Neal Koblitz - A Course in Number Theory and Cryptography
Douglas R. Stinson - Cryptography. Theory and Practice
Office hours: To be booked.
EMANUELA DE NEGRI (President)
ALESSIO CAMINATA (President Substitute)
The class will start according to the academic calendar.
All class schedules are posted on the EasyAcademy portal.
Oral exams and students seminar
To attend the lessons is reccomended