|visits||member for||2 years, 2 months|
|seen||Jul 11 '13 at 18:08|
What is a trapdoor permutation?
Thanks for the explanation. I think I get the general idea, but I don't quite understand the math behind it. They describe the function g(x), which uses the RSA's public exponent e and modulus n. What would g(x)^-1 be in this case when provided with my RSA's private component d?