Cryptography, Security, Math, Encryption, Data Security.
there exists a d such that d = 1/e mod φ(n), i.e d * e = 1 mod φ(n). For every e, if a d exists, then that d is unique. Why use Euler’s Totient function or Euler’s Phi? And, why is it used? φ(n) is number of positive integers less than n that are co-prime to n. φ(n) counts the positive integers