Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
P We c an iter ate the multiplicat ion property on the s ingle congruence a / b (mod m) to obtain:
< a2 < a3 < a4 < ... < an / b2 (mod m) / b3 (mod m) / b4 (mod m) / bn (mod m)
< by any ot her quantity w hich is in t he s ame congruence class, and t he res ult will be t he same < H owever, w e cannot chan ge exponents in this fas hion w ithout chan ging t he value of t he expression
P But w e c annot s imilar ly reduc e the exponent (mod 17); we have no s uch ru le. In fact, doing so would give us the wro ng answer! P But Fer mats Little Theorem gives us a s lic k w ay to do it:
< F LT t ells us that 16 16 / 1 (mod 17) < Thus (16 16)k / 1 (mod 17) for any pos itive inte ger k < 995 = 6216 + 3. So Ill writ e 16 995 as 16 6216 + 3, w hich is 16 6216 16 3 / 1 16 3 which is just 16 (mod 17).
RSA Encryption
P Alice w ishes to be able to rec eive secure messages from Everybody
< A lice obtains a key, K, and a d ecoder, D < A lice pub lishes her key , K, for Ev ery body to s ee < But s he keeps D s ecret < Every body can use K t o encode t he message < O nly Alice can decode the message, usin g D
P Facts:
< F or a prime p, N( p) = p 1 < F or primes p and q, N( pq ) = ( p 1)( q 1)
P Theorem:
< F or any a and n, relat ively prime to each ot her, there exists a b s uch t hat ab / 1 (mod n)