Establishment
Language of instruction
French, English
Teaching content
MB-IT
Training officer(s)
G.CHÊNEVERT, D.DELANNOY
Stakeholder(s)
G.CHÊNEVERT
Présentation
Prerequisite
In order to take this class, the student must be familiar with basic notions pertaining to algorithms (implementation in a procedural programming language, complexity analysis), as well as with the manipulations related to the binary representation of data and some basic mathematical concepts (vector algebra, modular arithmetic, probability theory).
Goal
Skills expected: 31 (311/312/313), 51 (511/512), 63 (634), 101 (1011), 110 (1101/1102), 1110 (11104)
This class is about the fondamental concepts of modern cryptography. These notions are used in numerous applications such as the securization of internet communication, secure payment, electronic currencies, document signing, ...
Its orientation is suitable to all the engineer profiles of the domains: software development, big data, cybersecurity, connected objects, business engineer, ...
At the end of the class, the student will be able to:
• Understand and be familiarized with the different cryptographic primitives encountered in secure digital communication protocols;
• Appreciated the (believed) hardness of computational problems on which the security of those rely;
• Use and apply in a concrete way cryptographic algorithms using standard software libraries;
• Understand how cryptographic primitives can be assembled to form modern cryptographic protocols and the properties those have according to the chosen parameters;
• Present a sound opinion on the society issues related to the uses of cryptography.
This class is about the fondamental concepts of modern cryptography. These notions are used in numerous applications such as the securization of internet communication, secure payment, electronic currencies, document signing, ...
Its orientation is suitable to all the engineer profiles of the domains: software development, big data, cybersecurity, connected objects, business engineer, ...
At the end of the class, the student will be able to:
• Understand and be familiarized with the different cryptographic primitives encountered in secure digital communication protocols;
• Appreciated the (believed) hardness of computational problems on which the security of those rely;
• Use and apply in a concrete way cryptographic algorithms using standard software libraries;
• Understand how cryptographic primitives can be assembled to form modern cryptographic protocols and the properties those have according to the chosen parameters;
• Present a sound opinion on the society issues related to the uses of cryptography.
Presentation
This class covers the following topics:
• Symmetric encryption: semantic security, stream ciphers, block ciphers, operation modes;
• Authentication; hash functions, message authentification codes, authenticated encryption;
• Asymmetric encryption: RSA, discrete logarithm problem, Diffie-Hellman, elliptic curves;
• Electronic signature: certificates, key management, trust issues.
• Symmetric encryption: semantic security, stream ciphers, block ciphers, operation modes;
• Authentication; hash functions, message authentification codes, authenticated encryption;
• Asymmetric encryption: RSA, discrete logarithm problem, Diffie-Hellman, elliptic curves;
• Electronic signature: certificates, key management, trust issues.
Modalités
Forms of instruction
Cours, travaux pratiques, étude de cas
Organization
Type | Amount of time | Comment | |
---|---|---|---|
Face to face | |||
Lectures - face to face | 14,00 | ||
Lab | 14,00 | ||
Independent study | |||
Independent study | 40,00 | ||
Overall student workload | 68,00 |
Evaluation
Control type | Duration | Amount | Weighting |
---|---|---|---|
Continuous assessment | |||
Lab grade | 2,00 | 6 | 60,00 |
Others | |||
Mini-project | 1,00 | 1 | 40,00 |
TOTAL | 100,00 |