Cryptography, Blockchain, Mathematics, Cryptocurrency, Bitcoin.
2⁰*P. Now, the all the (kth power of 2)*P can be calculated in log(k) time as follows : 2*P = P + P 4*P = 2*P + 2*P 8*P = 4*P + 4*P 16*P = 8*P + 8*P and so on… Finding n given and P and n*P is known as the elliptic curve discrete logarithm problem (ECDLP). It has no known polynomial time solution