![]() |
Python
1.0
|
Namespaces | |
_05d_rsa | |
An RSA algorithm for public-key cryptography. | |
Functions | |
def | _05d_rsa.egcd (a, b) |
The extended Euclidean algorithm for the Greatest Common Divisor of two integers. More... | |
def | _05d_rsa.modinv (a, m) |
Calculates the modular inverse of an integer. More... | |
def | _05d_rsa.modinv2 (a, b, c) |
Calculates the modular inverse of an integer. More... | |
def | _05d_rsa.power_mod_n (c, d, n) |
Calculates c to the power of d mod n. More... | |
def | _05d_rsa.generateKeys (p, q) |
Generates the public and private keys. More... | |
def | _05d_rsa.main () |