The implementation of cryptographic protocols requires the manipulation of large numbers with binary decomposition lengths which may go from 256 to 2048. Whether it be for software or hardware applications, the manipulation of words of such length requires specific algorithms. The aim of the course is to understand the arithmetic of large numbers in order to implement a cryptographic protocol in its entirety.
Prerequisites: Algorithms, Asymmetric cryptography
| On completion of the unit, the student will be capable of: | Classification level | Priority |
|---|---|---|
| Understanding the issues of manipulating large numbers | 2. Understand | Essential |
| Applying a large number algorithm | 3. Apply | Essential |
| Percentage ratio of individual assessment | Percentage ratio of group assessment | ||||
|---|---|---|---|---|---|
| Written exam: | % | Project submission: | % | ||
| Individual oral exam: | % | Group presentation: | % | ||
| Individual presentation: | % | Group practical exercise: | % | ||
| Individual practical exercise: | % | Group report: | % | ||
| Individual report: | 100 | % | |||
| Other(s): % | |||||
| Type of teaching activity | Content, sequencing and organisation |
|---|---|
| Course/Supervised study | Introduction to the arithmetic of large numbers through RSA and ECDSA protocols Description of solutions for addition and subtracting large numbers with practical application Description of solutions for the multiplication and production of RSA and ECDSA |