Cryptography (2017/2018)

Course code
Name of lecturer
Roberto Segala
Roberto Segala
Number of ECTS credits allocated
Academic sector
Language of instruction
I sem. dal Oct 2, 2017 al Jan 31, 2018.

Lesson timetable

Go to lesson schedule

Learning outcomes

The course aims at providing the basic elements and computational tools for data encryption, use of cryptography for secure communication, and implementation of cryptographic primitives. Emphasis is given on the structure of the main cryptographic algorithms and protocols, on the definition of the underlying problems, and on the formal tools for analysis of correctness.


Symmetric key cryptography (DES, AES), CBC, public key cryptography (Diffie-Hellman, RSA, BBS, El Gamal), provable security and provably secure cryptosystems, one-way trapdoor functions, pseudo-random bit and function generators, digital signatures (RSA), collision-free hash functions (MD5, SHA1), bit commitment, verifiable secret sharing, Zero-Knowledge, message authentication, agent authentication.

Reference books
Author Title Publisher Year ISBN Note
B. Schneier Applied Cryptography (Edizione 2) John Wiley & Sons 1996 0471117099
W. Stallings Cryptography and Network Security: Principles and Practice (Edizione 2) Prentice Hall 1999 0-13-86901
Menezes A, Van Oorschot P, Vanstone S Handbook of Applied Cryptography CRC Press 1996 0-8493-852

Assessment methods and criteria

The exam is an oral colloquium on the topics of the program.

The evaluation scale is the following. 18-28 (pure notionistic knowledge), 22-24 (acceptable understanding of the arguments), 25-27 (ability to apply the concepts learned in the course), 28-30 (ability to elaborate autonomous ideas based on the concepts learned in the course).