Cryptography, Elliptic Curves, Rsa, Blockchain, Bitcoin.
Q=n•P where n is the number of iterations of point multiplication done. Mathematically this works out to Q = P + P + P … n times. So if you knew the curve we used, the starting point P and the ending point Q, could you determine n? It turns out there is no known algorithm to do this. No short cuts