Euler's totient function and Carmichael's totient function in RSA
43003
lcm versus phi in RSA
38727
Modular Exponentiation and Primes
40642
Using same modulus for RSA
40101
Does Knowing Two Proper Factors of an RSA Public Key Permit Decryption if $N$ is Not a Semiprime?
70064
Computational complexity of RSA
114136
Euler's $\phi(n)$ function and solutions of $\phi(n) = 4294967296=2^{32}$
51626
Is a known plaintext, ciphertext, and public-key a viable attack on RSA?
109461
Solving equation involving Euler's totient function
124220
Using Euler's Totient Function, how do I find all values n such that $\phi(n)=12$?
43477
Choosing between additive or multiplicative group for Diffie-Hellman
48998
How to calculate number of possible key pairs in RSA
65214
How can I prove the Carmichael theorem
99815
Dividing versus multiplying by inverse in modular arithmetic
141704
Fractional exponentiation in modular arithmetic
152372
Verifying Carmichael numbers
107866
How is information disclosed by modular multiplication?
30045
Solving linear congruences by hand: modular fractions and inverses