RSA Example - Computer Science

RSA Example A small (and insecure) example [Stinson]:-Bob: - chooses p = 101, q = 113 - computes n = pq = 11413 and φ(n) = (p-1)(q-1) = 11200 - chooses e = 3533 (note: gcd(e,φ(n))=1)-computes d = e-1 mod φ(n) = 6597 - publishes n and e (keeps p, q, and d

www.cs.rit.edu