be thankful for this; if there was a way to do either one, then elliptic curve cryptography would be broken faster than you can say “binary search” and “Chinese remainder theorem”
Quadratic Arithmetic Programs: from Zero to Hero
Vitalik Buterin

In a elliptic curve defined over F_p, and size of p being much smaller than its RSA counterpart, the number of points will be much lesser.

Adding a point n times to reach new point on curve is easy, but hardness comes from deducing this n, given two points.

But what I’m not able to understand in this is that how >< operators can break it very fast. We do not even define them. Is this has something to do with range queries, because all points are bounded.

Show your support

Clapping shows how much you appreciated Ronak Kogta’s story.