Thanks for this. I was unclear on this point. So looking at the discrete log problem vs a trapdoor function: Discrete log: for f(x) = y - Easy: given

Thanks for this. I was unclear on this point. So looking at the discrete log problem vs a trapdoor function: Discrete log: for f(x) = y - Easy: given f and x find y. - Hard: given f and y find x. Trapdoor: for f(x) = y - Easy: given f and y find x, given a secret, e.g. (p-1)(q-1) in RSA. - Hard: given f and y find x, without possesion of the secret. Is that accurate, or have I misstated the essential difference somehow?