
Page 1 of 2
Download
Get this sheet
SubscriptionOpen any sheet in any course, up to 40 a month, keys included. Or $40 month to month.
$25/mo, billed yearly
SubscribeTry one first: a free Chapter 1 worksheet (PDF, no sign-in).
What's on the worksheet
- Naomi built her RSA key from two primes that are close together.
- Jenny builds an RSA key from the primes p = 7 and q = 31.
- Aisha sends one letter, coded A = 1, B = 2, ..., Z = 26, to two friends, locking it with the public exponent 3 both times.
- Kevin signs with the RSA public key (143, 7) and a private exponent he keeps secret.
- Let p and q be different primes, both greater than 3, and let n = pq.
Teach it first
The free lesson teaches it with worked examples and practice problems.
RSA public-key encryption: the lesson ›More Chapter 8 worksheets: Number theory and modular arithmetic
- 8.1Every number has exactly one prime factorization
- 8.2The division algorithm
- 8.3Numbers in other bases
- 8.4The Euclidean algorithm and coprime numbers
- 8.5Bezout's identity and the extended Euclidean algorithm
- 8.6Congruence modulo n and its arithmetic
- 8.7Relations, equivalence classes and partitions
- 8.8Where the divisibility tests come from
- 8.9Powers modulo n
- 8.10Modular inverses and linear congruences
- 8.11The Chinese remainder theorem
- 8.12Fermat's little theorem
- 8.13RSA public-key encryption