Comment on How RSA Works: TLS FoundationsparentComments−baby8yHow can a prime number have any divisor that isn't 1What 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 isit allows you to compute the private key out of the public key (only possible if the totient is coprime with the public key)−mabbo8yYes, but why? Just saying "here's the algorithm" doesn't really explain why it works.
Comments
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.
it allows you to compute the private key out of the public key (only possible if the totient is coprime with the public key)
Yes, but why? Just saying "here's the algorithm" doesn't really explain why it works.