182-2 | Mathematics for cryptography | Computer Science - Apprenticeship | S5 | ||||||
---|---|---|---|---|---|---|---|---|---|
Lessons : 10 h | TD : 6 h | TP : 6 h | Project : 0 h | Total : 22 h | |||||
Co-ordinator : Morgan Barbier |
Prerequisite | |
---|---|
Non renseigné | |
Course Objectives | |
The mains goals is to understand the mathematical tools for the modern cryptography |
|
Syllabus | |
I- Functions - One way functions - Birthday paradox - Hash functions II- Arithmetic over Z - GCD, LCM, Euclide's algorithm - Primes numbers, factorization - Euler III- Modular arithmétique Z/nZ - Basics operations - Inversible element and computation - Euler and Fermat theorems - Chines Remainder Theorem |
|
Practical work (TD or TP) | |
Non renseigné | |
Acquired skills | |
Basic maths | |
Bibliography | |
Non renseigné |
© 2024 - ENSICAEN ( Legal Notices - Credits )