Share
Explore BrainMass

RSA encryptions

(See attached file for full problem description)

---
Consider the RSA encryption system given by p=43,q=59, and e=13
i) Find d such that ed ≡ 1 (mod (p-1)(q-1))
ii) Decode the message : 1552 2069 1178 1637 1975
Using the convention A = 00, B = 01, ..., Z = 25
---

Attachments

$2.19