This project includes implementations of the Euclidean algorithm and the Extended Euclidean algorithm (包含欧几里得算法及扩展欧几里得算法的实现).
Email: kyiwong97@gmail.com
To implement the standard RSA algorithm and compute the modular multiplicative inverse.
- Compute:
$n = p \times q$ - Calculate:
$\phi(n) = (p-1) \times (q-1)$ - Choose:
$e$ such that$0 < e < \phi(n)$ - Compute:
$d = \mathrm{inverse}(e, \phi(n))$ - Encryption:
$c = m^e \mod n$ - Decryption:
$m = c^d \mod n$