Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
goelp14
GitHub Repository: goelp14/easyctf-iv-problems
Path: blob/master/hidden_key/solution.txt
671 views
1
There's a second valid decryption exponent in RSA: https://marinaibrishimova.net/docs/otherkeys.pdf
2
3
can be calculated with: d2 = d+phi(n)/2
4
5
Just divide the 2d+phi(n) value by 2 and use it to decrypt C.
6
7