Code: | CC4017 | Acronym: | CC4017 | Level: | 400 |
Keywords | |
---|---|
Classification | Keyword |
OFICIAL | Computer Science |
Active? | Yes |
Web Page: | https://www.dcc.fc.up.pt/~rvr/aulas/AC2122/Cripto-2122/ |
Responsible unit: | Department of Computer Science |
Course/CS Responsible: | Master in Computer Science |
Acronym | No. of Students | Study Plan | Curricular Years | Credits UCN | Credits ECTS | Contact hours | Total Time |
---|---|---|---|---|---|---|---|
M:CC | 6 | Study plan since 2014/2015 | 1 | - | 6 | 42 | 162 |
M:M | 0 | Plano Oficial do ano letivo 2021 | 2 | - | 6 | 42 | 162 |
To understand the security problem with computer networks as well as security problems in general and the use of cryptography in this context.
The study of the most relevant cryptographic primitives, the security guarantees that they provide, their possible applications and good practices, as well as possible attacks.
To get acquainted to a sufficient large set of cryptographic protocols such that it is possible to port "real life” activities to the digital realm.
At the end of the course, the students are expected to:
Introduction to cryptography and information security
One-Time-Pad, perfect secrecy
Computational security and stream ciphers
Block ciphers and constructions, modes of operation and abstractions (PRF, PRP)
Standard symmetric encryption schemes: IND-CPA security, nonce-base security (CTR mode)
Message integrity: definitions and applications
Hash functions and collision-resistance; authentication from hash functions (SHA and HMAC)
Authenticated encryption: security against active adversaries, key distribution.
Cryptography from modular arithmetic: Diffie-Hellman protocol.
Public-key encryption: IND-CPA security and ElGamal encryption, IND-CCA security. Rabin and RSA functions; how to encrypt with one-way trapdoor permutations.
Digital signatures, definitions and applications. How to sign with RSA.
Public-key certificates, why they are needed and how they are used.
Cryptographic authentication: challenge-response mechanisms.After the exposition of problems and known solutions to these problems, students will be confronted with small practical assignments that involve the implementation or integration of the presented cryptographic algorithms, as well as implementing attacks to some of these algorithms that may better illustrate why some of the presented solutions are better than others.
Assessment will be performed via distributed grading with a final test.
Final grading formula: midterm * 0.5 + final test * 0.5.designation | Weight (%) |
---|---|
Exame | 50,00 |
Teste | 50,00 |
Total: | 100,00 |
designation | Time (hours) |
---|---|
Estudo autónomo | 60,00 |
Frequência das aulas | 42,00 |
Trabalho laboratorial | 60,00 |
Total: | 162,00 |