Cryptography, Security, Math, Encryption, Data Security.
= pq — p — q + 1 = (p-1)(q-1), since n = pq. QED The merit of using Euler’s totient lies in Euler’s theorem, which states that if p and q are co-prime numbers, then q to the power of φ(p) is congruent to 1 (mod p). This theorem underpins the mathematics that make public key cryptography, i.e. the