

0 / 2 embers
0 / 3000 xp
click for more info
Complete a lesson to start your streak
click for more info
Difficulty: 3
click for more info
Not enough gems
Cost: 6 gems
1: RSA
incomplete
2: RSA vs. ECC
incomplete
3: RSA Key Generation
incomplete
4: Totient and E
incomplete
5: Modular Arithmetic
incomplete
6: Modular Arithmetic
incomplete
7: Encryption
incomplete
8: Multiplicative Inverse
incomplete
9: Private Key
incomplete
10: Decryption
incomplete
11: Encryption and Decryption Explained
incomplete
Back
ctrl+,
Next
ctrl+.
This lesson's interactive features are locked, please to keep using them
Decryption in RSA is almost unbelievably simple from a mathematics perspective but remains extremely secure.
The only known way to efficiently crack a secure RSA system is with a $5 wrench.
-- xkcd
Complete the decrypt function.
func decrypt(c, d, n *big.Int) *big.Int
Use the big.Int.Exp function to raise the encrypted message (c) to the power of the private key (d) within (mod n).