03LPYOV

A.A. 2020/21

Course Language

Inglese

Degree programme(s)

Master of science-level of the Bologna process in Ingegneria Informatica (Computer Engineering) - Torino

Course structure

Teaching | Hours |
---|---|

Lezioni | 40 |

Esercitazioni in aula | 20 |

Lecturers

Teacher | Status | SSD | h.Les | h.Ex | h.Lab | h.Tut | Years teaching |
---|---|---|---|---|---|---|---|

Di Scala Antonio Jose' | Professore Ordinario | MAT/03 | 40 | 0 | 0 | 0 | 5 |

Co-lectuers

Context

SSD | CFU | Activities | Area context |
---|---|---|---|

ING-INF/05 MAT/03 |
3 3 |
B - Caratterizzanti F - Altre attivitą (art. 10) |
Ingegneria informatica Abilitą informatiche e telematiche |

2020/21

This is a first course of Cryptography.
It is about the state-of-the-art of the principal cryptographic algorithms currently used for computer system security purposes.

This is a first course of Cryptography.
It is about the state-of-the-art of the principal cryptographic algorithms currently used for computer system security purposes.

Students are expected to learn:
Cryptographic programming.
Symmetric cryptography primitives as: Block Ciphers, Stream Ciphers and Hash Functions.
Asymmetric cryptosystems as: Key Exchange, Public Key Cryptography
Protocols as: DSA, SRP and SAE.

Students are expected to learn:
Cryptographic programming.
Symmetric cryptography primitives as: Block Ciphers, Stream Ciphers and Hash Functions.
Asymmetric cryptosystems as: Key Exchange, Public Key Cryptography
Protocols as: DSA, SRP and SAE.

Basics of programming in C.
Basics of computer security.
Basics of linear algebra as in courses of "Linear Algebra and Geometry" of the first year.

Basics of programming in C.
Basics of computer security.
Basics of linear algebra as in courses of "Linear Algebra and Geometry" of the first year.

Cryptographic programming:
use of cryptographic primitives in C.
use of cryptographic primitives in python.
Symmetric Cryptography:
Block-Ciphers: DES, AES.
Operations Modes: ECB,CBC,CTR,OFB,CFB,GCM,CCM.
Stream-Ciphers and PRNG:
ARX algorithms: RC4, Salsa e Chacha20.
Permutation algorithm: Sponge PRNG
Hash Functions:
ARX : SHA1, SHA2
Permutation: SHA3
Asymmetric Cryptography:
DH Key Exchange on finite fields.
DH on elliptic curves.
RSA.
Protocols: DSA,SAE and SRP.

Cryptographic programming:
use of cryptographic primitives in C.
use of cryptographic primitives in python.
Symmetric Cryptography:
Block-Ciphers: DES, AES.
Operations Modes: ECB,CBC,CTR,OFB,CFB,GCM,CCM.
Stream-Ciphers and PRNG:
ARX algorithms: RC4, Salsa e Chacha20.
Permutation algorithm: Sponge PRNG
Hash Functions:
ARX : SHA1, SHA2
Permutation: SHA3
Asymmetric Cryptography:
DH Key Exchange on finite fields.
DH on elliptic curves.
RSA.
Protocols: DSA,SAE and SRP.

40 hs of Lectures.
20 hs of Exercises.

40 hs of Lectures.
20 hs of Exercises.

Serious Cryptography: A Practical Introduction to Modern Encryption
Jean-Philippe Aumasson,
No Starch Press, 2018.
Understanding Cryptography, A Textbook for Students and Practitioners
Paar, Christof, Pelzl, Jan,
Springer-Verlag, 2010.
Applied Cryptography: Protocols, Algorithms and Source Code in C
Bruce Schneier,
Wiley; 20th Anniversary edition,2015.

Serious Cryptography: A Practical Introduction to Modern Encryption
Jean-Philippe Aumasson,
No Starch Press, 2018.
Understanding Cryptography, A Textbook for Students and Practitioners
Paar, Christof, Pelzl, Jan,
Springer-Verlag, 2010.
Applied Cryptography: Protocols, Algorithms and Source Code in C
Bruce Schneier,
Wiley; 20th Anniversary edition,2015.

The final exam is a written test with open and closed answers to be carried out via PC. An oral exam is optional at the request of the student or at the discretion of the teacher. During the written test students cannot consult books, notes or other teaching materials. The written test is considered passed if its result is greater than or equal to 18/30. Only students who have passed the written test can ask to take the oral test as well. If requested, the oral test contributes to determine the final result of the exam together with the written one.

The final exam is a written test with open and closed answers to be carried out via PC. An oral exam is optional at the request of the student or at the discretion of the teacher. During the written test students cannot consult books, notes or other teaching materials. The written test is considered passed if its result is greater than or equal to 18/30. Only students who have passed the written test can ask to take the oral test as well. If requested, the oral test contributes to determine the final result of the exam together with the written one.

The final exam is a written test with open and closed answers. An oral exam is optional at the request of the student or at the discretion of the teacher. During the written test students cannot consult books, notes or other teaching materials. The written test is considered passed if its result is greater than or equal to 18/30. Only students who have passed the written test can ask to take the oral test as well. If requested, the oral test contributes to determine the final result of the exam together with the written one.

The final exam is a written test with open and closed answers. An oral exam is optional at the request of the student or at the discretion of the teacher. During the written test students cannot consult books, notes or other teaching materials. The written test is considered passed if its result is greater than or equal to 18/30. Only students who have passed the written test can ask to take the oral test as well. If requested, the oral test contributes to determine the final result of the exam together with the written one.

© Politecnico di Torino

Corso Duca degli Abruzzi, 24 - 10129 Torino, ITALY

Corso Duca degli Abruzzi, 24 - 10129 Torino, ITALY