CODE 109043 ACADEMIC YEAR 2025/2026 CREDITS 6 cfu anno 1 MATEMATICA 11907 (LM-40 R) - GENOVA 6 cfu anno 2 MATEMATICA 9011 (LM-40) - GENOVA SCIENTIFIC DISCIPLINARY SECTOR MAT/02 LANGUAGE Italian (English on demand) TEACHING LOCATION GENOVA SEMESTER 1° Semester OVERVIEW This course provides an introduction to modern Cryptography and related mathematical problems. AIMS AND CONTENT LEARNING OUTCOMES The purpose of the course is to provide a knowledge of the main concepts and tools of cryptography. AIMS AND LEARNING OUTCOMES The aim of the course is to provide mathematical tools employed by modern Cryptography which are fundamental to pursue further studies in this field. In particular, we will focus on public-key Cryptography. More precisely, at the end of the course students will be able to: • recognise the main modern cryptosystems and digital signatures; • master factoring algorithms and primality tests; • spot weaknesses of a cryptosystem; • recognise the main attacks to the Discrete Logarithm Problem; • master algebraic and geometric constructions which are fundamental in Cryptography such as algebraic curves, finite groups, polynomials and lattices. PREREQUISITES The following mathematical prerequisites are mandatory: modular arithmetic, linear algebra, groups, fields. It is recommended to have passed one linear algebra course (e.g. ALGA) and one abstract algebra course (e.g. Algebra 1+2). TEACHING METHODS Lectures. SYLLABUS/CONTENT - Classic Cryptosystems (substitution, Hill, Vigenère) - Shannon’s Theory, Perfect Secrecy, and the One-Time Pad - Public Key Cryptography (RSA cryptosystem and Diffie-Hellman key exchange) - Primality tests (Legendre, Solovay-Strassen, Miller-Rabin) - Factoring Algorithms (Pollard p-1, quadratic sieve) - Discrete Logarithm Problem and related attacks (Baby Step Giant Step, Pollard rho, Pohlig-Hellman, Index Calculus) - Elliptic Curve Cryptography - An introduction to post-quantum Cryptography RECOMMENDED READING/BIBLIOGRAPHY - Stinson, Paterson - "Cryptography. Theory and Practice" - Galbraith - "Mathematics of Public Key Cryptography" - Silverman, Pipher, Hoffstein - "An Introduction to Mathematical Cryptography" TEACHERS AND EXAM BOARD ALESSIO CAMINATA Ricevimento: By appointment. EMANUELA DE NEGRI Ricevimento: By appointment. LESSONS LESSONS START The class will start according to the academic calendar. Class schedule The timetable for this course is available here: Portale EasyAcademy EXAMS EXAM DESCRIPTION Oral exam. Students with DSA certification ("specific learning disabilities"), disability or other special educational needs are advised to contact the teacher at the beginning of the course to agree on teaching and examination methods that, in compliance with the teaching objectives, take account of individual learning arrangements and provide appropriate compensatory tools. ASSESSMENT METHODS Questions of the oral exam will concern the main topics presented during the lectures. The aim is to establish not only whether students will have reached an appropriate level of knowledge, but also whether they can analize and approach problems related to Cryptography. FURTHER INFORMATION Attendance is recommended.