Encryption, Post Quantum Cryptography, Elliptic Curve, Digital Signatures, Kyber.
can write that as P = G + ··· + G (n times) or use some mathematical syntactic sugar to write that as P = nG, which reads n times G. The elliptic curve discrete logarithm problem (ECDLP) is to find the number n from knowing just P and G. Algebraically, the addition and Doubling looks like below.