3 ms·
> How can a prime number have any divisor that isn't 1 What they mean by "gcd of 1 in relation to" is what we call "coprime". 5 and 3 are coprime because noth
by baby 9y ago
> How can a prime number have any divisor that isn't 1
What they mean by "gcd of 1 in relation to" is what we call "coprime".
5 and 3 are coprime because nothing but 1 divides both at the same time.
> what purpose the totient value is
it allows you to compute the private key out of the public key (only possible if the totient is coprime with the public key)
- mabbo 9y agoYes, but why? Just saying "here's the algorithm" doesn't really explain why it works.