Suppose you encrypt messages m by computing c ? m^3 (mod 101). How do you decrypt? (That is, you

Name: Suppose you encrypt messages m by computing c ? m^3 (mod 101). How do you decrypt? (That is, you want a decryption exponent d such that c^d ? m (mod 101); note that 101 is prime.)
Uploaded: 2023-05-02T22:40:37-08:00
Duration: 2 min 23 s
Channel: Hoan Nguyen
Description: Suppose you encrypt messages m by computing c ? m^3 (mod 101). How do you decrypt? (That is, you want a decryption exponent d such that c^d ? m (mod 101); note that 101 is prime.)

Question

Vikash Ranjan · Accepted Answer

1. We are given that the encryption function is $E(m) = m^3 pmod{101}$.

Question

Suppose you encrypt messages m by computing c ? m^3 (mod 101). How do you decrypt? (That is, you want a decryption exponent d such that c^d ? m (mod 101); note that 101 is prime.)

Please give Ace some feedback