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.
\[x^y \mod N\]
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
\[d \equiv e^{-1} \mod \Phi(N)\]
Links to the material of the lecture:
For any doubts feel free to contact me.
Thank you.