RSA decryption: m = c^d mod n
(priv_key: &PrivateKey, ciphertext: u64)
| 68 | |
| 69 | // RSA decryption: m = c^d mod n |
| 70 | fn decrypt(priv_key: &PrivateKey, ciphertext: u64) -> u64 { |
| 71 | mod_exp(ciphertext, priv_key.d, priv_key.n) |
| 72 | } |
| 73 | |
| 74 | // Main test function |
| 75 | fn main() { |