How RSA Works: TLS Foundations
I find the description of the RSA math pretty confusing. And I'm saying that with a minor in math and a CS degree specializing in security; I've don't this before, just not in a while.For example:>In order to generate e, we'll need to find a random prime number that has a greatest common divisor (GCD) of 1 in relation to ϕ(n).How can a prime number have any divisor that isn't 1, let alone a gcd? Either that's mistaken, or it's unnecessary to state.There's also no explanation of what purpose the totient value is. The author simply states it's needed, but not what value it provides.In short, it feels like it's written for people who already know the answers, not for people trying to learn.