Rsa Algorithm, Rsa Encryption, Cryptography, Quantum Computing, Quantum Computer.
1. In our case e=3. Finding the decryption key = d // In this case e *d = 1 mod Φ(n), therefore in our case d = 267. Other possible decryption keys can be 427, 587, 747 and 907. CONGRATULATIONS! We now have n= 187, the encryption key = 3 and decryption key = 267. Encrypting a message = c// Bob