Please enable JavaScript.
Coggle requires JavaScript to display documents.
asymmetric ciphers (RSA (encrypting (7^e mod n = c), decrypt (C^d mod n =…
asymmetric ciphers
-
crack RSA
1) we already know (e,n) = public key
-
-
-
5) What’s ϕ(n) ?
We know n has two prime factors, and hence ϕ(n) is (p-1)(q-1) but what are p and q?
-
-
relatively prime
greatest common divisor
GCD(15,10) = 5
GCD (18,10) = 2
relatively prime = GCD(A,B)=1
-