Security, Cryptography, Computer Science, Programming, Hacking.
n. Encrypting “cats” gives us 42⁷⁵ mod 35 = 7. Decrypting “cats” gives us 4430123. Then to send a message m, Bob computes c=m^e (mod N) and sends it to Alice and Alice decrypts the message using her private key d with m=c^d (mod N) Why does it work? Prime factorisation. It’s easy to multiply two