INFORMATION SECURITY
(objectives)
For introduction to cryptography: give an introduction to cryptography useful for understanding present-day innovations; explain the mathematical notions instrumental in the design of cryptographic algorithms and interest the students in the applications. The course aims to provide the tools for analyzing the security in telecommunication systems. The theoretical foundations, real implementation, systems for measuring the effectiveness of existing networks, security models are introduced during the course.
The problem of security in networked systems is introduced in, with reference to the cryptographic algorithms, protocols and standards. The course aims to provide a capacity for rational and systematic framework for ict security issues and tools available, including a preliminary capacity assessment of costs / benefits. Cloud systems security is also analyzed. The course will also touch on the the mathematical concepts needed in undertanding and possibly contructing cryptosystems and protocols, particularly in the realm of public-key cryptography.
|
Code
|
20801702 |
Language
|
ITA |
Type of certificate
|
Profit certificate
|
Module:
(objectives)
For introduction to cryptography: give an introduction to cryptography useful for understanding present-day innovations; explain the mathematical notions instrumental in the design of cryptographic algorithms and interest the students in the applications. The course aims to provide the tools for analyzing the security in telecommunication systems. The theoretical foundations, real implementation, systems for measuring the effectiveness of existing networks, security models are introduced during the course.
|
Code
|
20801702-1 |
Language
|
ITA |
Type of certificate
|
Profit certificate
|
Credits
|
6
|
Scientific Disciplinary Sector Code
|
MAT/03
|
Contact Hours
|
36
|
Type of Activity
|
Related or supplementary learning activities
|
Teacher
|
MEROLA FRANCESCA
(syllabus)
Introduction to cryptography. Cryptosystem. Classical Ciphers: additive ciphers, substitution ciphers, affine ciphers, transposition cipher, Vigenere cipher, Hill cipher, affine linear ciphers. Introduction to cryptanalysis. Cryptanalysis. Types of attack. Cryptanalysis of substitution, affine, Vigenere, Hill ciphers. Elements of Shannon theory. Perfect secrecy. Characterization of cryptosystems realizing perfect secrecy. One-time pad. Stream ciphers. Linear shift registers. Block ciphers. Substitution-permutation networks. Feistel ciphers. Data Encryption Standard. Triple DES. Advanced Encryption Standard (AES). modes of operation. Introduction to public key cryptography. Elements of complexity theory. Knapsack problem. Merkle-Hellman cipher. The RSA cryptosystem. The square and multiply algorithm. Primality testing. RSA and factoring. Some attacks on RSA. The discrete logarithm problem. Diffie-Hellman key exchange. Elgamal cryptosystem. Digital signature. Signature schemes. The RSA scheme. Notes on some cryptographic protocols. Modular arithmetic. Groups, cyclic groups. Permutations. Congruences, Euler function, invertible elements in Zn. Finite fields. Euler's theorem, Fermat's little theorem. Euclidean algorithm for calculating the MCD.
(reference books)
D. Stinson, Cryptography: theory and practice, Chapman and Hall. A. Languasco, A. Zaccagnini, Manuale di crittografia, Hoepli. W. Stallings, Crittografia e sicurezza delle reti, McGraw Hill.
|
Dates of beginning and end of teaching activities
|
From 01/10/2015 to 22/01/2016 |
Delivery mode
|
Traditional
|
Attendance
|
not mandatory
|
Evaluation methods
|
Written test
A project evaluation
|
|
|
Module:
(objectives)
The problem of security in networked systems is introduced in, with reference to the cryptographic algorithms, protocols and standards. The course aims to provide a capacity for rational and systematic framework for ict security issues and tools available, including a preliminary capacity assessment of costs / benefits. Cloud systems security is also analyzed. The course will also touch on the the mathematical concepts needed in undertanding and possibly contructing cryptosystems and protocols, particularly in the realm of public-key cryptography.
|
Code
|
20801702-2 |
Language
|
ITA |
Type of certificate
|
Profit certificate
|
Credits
|
6
|
Scientific Disciplinary Sector Code
|
ING-INF/03
|
Contact Hours
|
36
|
Type of Activity
|
Core compulsory activities
|
Teacher
|
CARLI MARCO
(syllabus)
Kerberos e Diameter Sicurezza IP Web security Authentication Intrusion detection Honey pot Android security Cloud security Big data security Forensics Digital watermarking
(reference books)
Stallings’ Cryptography and Network Security, Seventh Edition
|
Dates of beginning and end of teaching activities
|
From 01/10/2015 to 22/01/2016 |
Delivery mode
|
Traditional
|
Attendance
|
not mandatory
|
|
|
|