This question already has an answer here:
- lcm versus phi in RSA 2 answers
I'm a high school student taking IB and I'm doing my EE on Maths, more specifically on the effectiveness of Euler's totient function and Carmichael's totient function in RSA.
- Am I right in thinking that Euler's and Carmichael's can be used interchangeably to generate the public key in RSA?
- To compare their 'effectiveness' I will first compare the amount of time it takes to generate a public key using each function based on time complexity. Secondly, I want to compare the security of the public key (meaning 'how difficult it is to guess the private key given the public key'). But how? Is there an algorithm to use to test the security of an encryption key?