Real cases
A case · you decide
The modulus and Euler's φ build a tiny key
The modulus n = p·q & Euler's φ(n) — a 16-year-old building a toy RSA key by hand for maths club
Noor picks the primes p = 5 and q = 11. She will publish n and keep p and q secret.
The modulus: n = 5 × 11 = 55.
Euler's φ: (5 − 1) × (11 − 1).
What is φ(n)?
The secret is not a number you hide. It is a factorisation nobody can find.
A case · you decide
The public and private exponents make a pair
The private exponent d & The public exponent e — a 17-year-old finishing the same toy key
With φ = 40, Noor chooses the public exponent e = 3. Now she needs d so that 3 × d leaves a remainder of 1 when divided by 40.
The public exponent e is shared with everyone.
The private exponent d undoes it: e × d ≡ 1 (mod 40).
What is d?
Finding d needs φ, and finding φ needs the two primes.