Cryptography
A.Y. 2019/2020
Learning objectives
The objective of the course is to introduce the fundamental concepts and the most important applications of modern cryptography, with particular reference to the most important algorithms for symmetric and asymmetric cryptography, for the generation and application of hash and Mac functions, for digital signature, for key exchange, and for secret sharing.
Expected learning outcomes
At the end of the course, the student will know and will be able to apply the most important cryptographic techniques for ciphering, authentication, and data integrity. The student will be also able to evaluate the security of a cryptographic system.
Lesson period: Second semester
Assessment methods: Esame
Assessment result: voto verbalizzato in trentesimi
Single course
This course cannot be attended as a single course. Please check our list of single courses to find the ones available for enrolment.
Course syllabus and organization
Single session
Responsible
Lesson period
Second semester
Course syllabus
Classical cryptography
Classical cryptography techniques and cryptoanalysis. Cesar, Playfair and Hill ciphers. Polialphabetic ciphers. Vigenere cipher and its cryptoanalaysis. Ciphering mahines. One-time pad. Steganography.
Symmetric Criptography
Block cipher encryption. Feistel structures. DES and operation modes. Linear and differential cryptoanalysis. AES. Other symmetric ciphers: Blowfish, RC5. Stream cipher: RC4.
Asymmetric Criptography
Public key cryptograhy. RSA. Security and computational aspects. Primality tests. El-Gamal cryptosystem. Elliptic curve cryptography.
Hash functions and MAC
Hash functions: birthday attack, iterated hashfunctions, MD4, MD5, SHA-1, hash functions based on block ciphers. Message Authentication Code: CBC-MAC, MAC based on hash functions, HMAC.
Digital signature.
RSA, Digital Signature Standard.
Applications.
Key management and key exchange: Diffie-Hellmann. Sharing secret techniques: Visual cryptography.
Classical cryptography techniques and cryptoanalysis. Cesar, Playfair and Hill ciphers. Polialphabetic ciphers. Vigenere cipher and its cryptoanalaysis. Ciphering mahines. One-time pad. Steganography.
Symmetric Criptography
Block cipher encryption. Feistel structures. DES and operation modes. Linear and differential cryptoanalysis. AES. Other symmetric ciphers: Blowfish, RC5. Stream cipher: RC4.
Asymmetric Criptography
Public key cryptograhy. RSA. Security and computational aspects. Primality tests. El-Gamal cryptosystem. Elliptic curve cryptography.
Hash functions and MAC
Hash functions: birthday attack, iterated hashfunctions, MD4, MD5, SHA-1, hash functions based on block ciphers. Message Authentication Code: CBC-MAC, MAC based on hash functions, HMAC.
Digital signature.
RSA, Digital Signature Standard.
Applications.
Key management and key exchange: Diffie-Hellmann. Sharing secret techniques: Visual cryptography.
Prerequisites for admission
Stongly suggested to have passed Dicrete Mathematics
Teaching methods
Lecture
Teaching Resources
Website: http://scimatoc.ariel.ctu.unimi.it/v5/home/Default.aspx
William Stallings - Crittografia e Sicurezza delle Reti- Mc Graw Hill, 2003
Douglas Stinson -Cryptography: Theory and Practice (Second Edition) - Chapman 2002
William Stallings - Crittografia e Sicurezza delle Reti- Mc Graw Hill, 2003
Douglas Stinson -Cryptography: Theory and Practice (Second Edition) - Chapman 2002
Assessment methods and Criteria
Wirtten test with open answers. At the end of the test, the evaluation is expressed on a scale from 0 to 30, taking into account the following parameters: grade of knowledge on the topics, capacity of applying the knowledge to real problems.
INF/01 - INFORMATICS - University credits: 6
Lessons: 48 hours
Professor:
Cimato Stelvio
Shifts:
-
Professor:
Cimato StelvioProfessor(s)