Typo: should 2128 be 2^128? #80
Description
In elliptic-curve-cryptography-ecc it says: "We already know that a 256-bit curve (which means that p and n are 256-bit numbers) provides 128-bit security strength, which means that to find the private key from the public key or signature, the best known non-quantum algorithm will take approximately 2128 operations"
Shouldn't that be "2^128 operations"? Great project, one of the best explanations I have found on ECC. Thanks.