2. Recall RSA, where the ciphertext, C, of a plaintext message, M, is generated as C = M/ mod n, and decryption recovers

[answerhappygod]

2 Recall Rsa Where The Ciphertext C Of A Plaintext Message M Is Generated As C M Mod N And Decryption Recovers 1 (59.77 KiB) Viewed 24 times

2. Recall RSA, where the ciphertext, C, of a plaintext message, M, is generated as C = M/ mod n, and decryption recovers M = Cº mod n. M<n and n is a product of two distinct (and secret) primes, p and q, but n itself is not secret. f and g are chosen such that gcd (f, p(n)) = 1, 1<f<p(n), f g = 1 mod p(n), and g = f-¹ mod (n). Is {g, n} the public or private key? Justify your answer.