2 ms·
Funny, I though the private key had p and q, but then I reread the algo description The 1 mod (p-1)(q-1) comes from Euler's theorem and (p-1)(q-1) is how you c
by raverbashing 13y ago
Funny, I though the private key had p and q, but then I reread the algo description
The 1 mod (p-1)(q-1) comes from Euler's theorem and (p-1)(q-1) is how you calculate the totient for numbers that are the product of 2 primes p and q