Alice would like to communicate with Bob using RSA procedures. She thinks of two numbers $p = 3$, $q = 13$, and calculates $n = p · q = 39$.
Note: Only RSA trapdoor function can be used.
Bob would like to send a locked message to Alice $(A = 1, B = 2, ..., Z = 26)$ and sends each of them as separate message per letter. How to calculate encrypted message for $D$ $A$ $D$ ?
Can someone give me tip how to do it?