Basic Intro to Elliptic Curve Cryptography (2019)
I'm assuming that given a starting point A and a number of operations n, there's a much faster way of computing the end point than just iterating n times?Otherwise, determining n given A and an end point would just be a matter of iterating from A until you hit the end point and counting, right?Also, how do you actually use the keys to encrypt/decrypt?