Open
Description
I found this paragraph in the crypto/rsa
docs:
https://github.com/golang/go/blob/master/src/crypto/rsa/rsa.go#L187-L191
// Check that de ≡ 1 mod p-1, for each prime.
// This implies that e is coprime to each p-1 as e has a multiplicative
// inverse. Therefore e is coprime to lcm(p-1,q-1,r-1,...) =
// exponent(ℤ/nℤ). It also implies that a^de ≡ a mod p as a^(p-1) ≡ 1
// mod p. Thus a^de ≡ a mod n for all a coprime to n, as required.
It is a mistake to say x
is coprime to y
, because co and to convey the same thing. A number x
, y
can be coprime, but we say x
is prime to y
.
This is explicitly stated by Stewart in Galios Theory 3rd Edition (ISBN 1-58488-393-6), in Definition 3.14 on the topic of coprimes.