Applied Cryptography

Code:

CC4076

Acronym:

CC4076

Level:

400

Keywords
Classification	Keyword
OFICIAL	Computer Science

Instance: 2021/2022 - 1S

Active?	Yes
Responsible unit:	Department of Computer Science
Course/CS Responsible:	Master in Information Security

Cycles of Study/Courses

Acronym	No. of Students	Study Plan	Curricular Years	Credits UCN	Credits ECTS	Contact hours	Total Time
M:ERSI	17	Official Study Plan since 2021_M:ERSI.	1	-	6	42	162
M:SI	44	Study plan since 2020/2021	1	-	6	42	162

Teaching language

Suitable for English-speaking students

Objectives

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.

Learning outcomes and competences

At the end of the course, the students are expected to:

• Choose what protocols and products should be used, both at the role of users and at the role of system or network administrators.
• Analyse, modify, choose and implement the necessary protocols to the implementation of a practical solution for a problem.
• Integrate the cryptographic algorithms studied during the course in real-world applications.

Working method

Presencial

Program

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.

Mandatory literature

Jean-Philippe Aumasson; Serious Cryptography: A Practical Introduction to Modern Encryption, No Startch Press, 2017. ISBN: 9781593278267

Complementary Bibliography

Jonathan Katz; Introduction to modern cryptography. ISBN: 978-1-4665-7026-9

Teaching methods and learning activities

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 + grade of the final test * 0.5.

Evaluation Type

Distributed evaluation with final exam

Assessment Components

designation	Weight (%)
Exame	50,00
Teste	50,00
Total:	100,00

Amount of time allocated to each course unit

designation	Time (hours)
Estudo autónomo	60,00
Frequência das aulas	42,00
Trabalho laboratorial	60,00
Total:	162,00

Eligibility for exams

Handing in (and acceptance by lecturers) at least 50% of the projects proposed in TP classes.

Calculation formula of final grade

Components:

• A: Midterm test

• B: Final exam 

Final mark = .5*A + .5*B

Special assessment (TE, DA, ...)

Same set of rules as for other students.

Classification improvement

The mark in midterm and final exam can be improved in the resit exam.

Observations

Júri da UC: Manuel Barbosa, Rogério Reis.