4 ms·
I don't get the trap problem here. So I start with A, compute -B as A dot A, then continue my way until I decide to stop at E. So I had to compute the whole pat
by palata 5y ago
I don't get the trap problem here. So I start with A, compute -B as A dot A, then continue my way until I decide to stop at E. So I had to compute the whole path, right?
Now you give me A and E, why can't I just compute the path from A until I hit E? That looks like the same effort, so what did I miss?
- palata 5y agoOh that's actually the point of the exponentiation trick: I choose the private key first and then compute the path from it. Got it, sorry xD
- quantumcrypt 5y agoInstead of computing nA = A + A + … + A you can use the “exponentiation” by squaring trick: nA = (n/2)A + (n/2)A + (n%2)A. It takes logarithmically many steps.