This question already has an answer here:
- lcm versus phi in RSA 2 answers
I know that lcm(n) or Carmichael's totient function $\lambda(n)$ is now used instead of $\varphi(n)$ or Euler's totient function to generate the public key in RSA encryption? Why is this so? Are there any mathematical, computer scientific reasons behind this related to key security or efficiency?