what is the benefit of lcm in cryptography?
Regarding public key: In two prime RSA you often compute the secret key from the public as $d=e^{-1} \pmod {(p-1)(q-1)},\;$ but using $d=e^{-1} \pmod {\mathrm{lcm}(p-1,q-1)}$ may have some advantages.