Mathématics for computer sciences (part 2)
- UE code INFOB221
-
Schedule
15 15Quarter 1
- ECTS Credits 3
-
Language
French
- Teacher
At the end of the cursus, students should be able
See learning outcomes.
The lecture's content is divided into four chapters
1 Recurrence Equations
2 Number Theory
3 Cryptography
4 Elliptic Curves
Academic lectures (15h), accompanied by exercise sessions (15h)
Written exam made of exercices to solve (demonstrations included), proposed in January and Augustus.
Special care will be put on how students explain their mathematical reasoning and deductions. Clarity and formalism are thus important.
Many books in this area exist. To cite but only two, there are - R.P. Grimaldi. Discrete and combinatorial mathematics. An applied introduction. Fifth Edition. Pearson Eduction, 2004, or J. Hoffstein, J. Phiper et J.H. Silverman. An Introduction to Mathematical Cryptography, Springer, 2008.
Training | Study programme | Block | Credits | Mandatory |
---|---|---|---|---|
Bachelor in Computer Science | Standard | 0 | 3 | |
Bachelor in Computer Science | Standard | 2 | 3 |