search

osirislab / ctf101

CTF101, a wiki-project documenting Capture The Flag techniques.
https://ctf101.org/
MIT License
114 stars 25 forks source link

RSA #4

Closed boying44 closed 6 years ago

boying44 commented 6 years ago

Specify that the totient function λ(n) is Carmichael's totient function and not Euler's, and that λ(pq) = LCM(λ(p), λ(q)), that way it will be clearer what to look up for further reading.

oskarwirga commented 6 years ago

Per Wikipedia's RSA article regarding Euler's totient and Carmichael's totient:

Most of the implementations of RSA will accept exponents generated using either method

I think it's appropriate to keep it vague as different online examples and implementations may use either one. Will add λ(pq) = LCM(λ(p), λ(q))

oskarwirga commented 6 years ago

Commit 7a2978b24f987fa96a669566f849a63b89d3981f close #4