Descrizione
Sixth laboratory for the Computer Network Security (CNS) course at Tor Vergata during scholar year 2022-2023. In the laboratory we have seen two important algorithms in the context of modular arithmetic.
The first algorithm is the square-and-multiply, used to implement efficiently the modular exponentiation operation, which is heavily used in RSA.
The second algorithm instead is the extended euclidean algorithm, also needed in RSA during the computation of the private key, which is computed as a modular inverse
Timestamps
00:00:00 Efficient modular exponentiation
00:10:14 Square and multiply algorithm
00:26:50 Implementation
00:37:35 Modular inversion
00:42:00 Euclidean algorithm
00:46:40 Extended euclidean algorithm
00:59:25 RSA examples
01:09:40 Notes on mid-term I
Riferimenti / Materiale
https://github.com/LeonardoE95/yt-it/tree/main/src/2022-12-12-università-teaching-2022-2023-cns-06
https://teaching.leonardotamiano.xyz/cns/labs/lab_06_modular_arithmetic/