Given e
and φ(n)
, calculate the modular multiplicative inverse d
such that d x e mod φ(n) = 1
This is a script to calculate d
in the RSA encryption formula. More info can be found here.
- Get python 3.0
- Navigate to the directory where you can find
calc_d.py
- Modify the values of
e
and theφ(n)
in the script and save - Run the command
python calc_d.py