An algorithm is presented that in context of public key use of Elliptic Curve
Cryptography allows discovery of the private key in worst case O(n).