3 ms·
Perhaps I’m showing my ignorance, but isn’t elliptic curve cryptography different?
by zeristor 7y ago
Perhaps I’m showing my ignorance, but isn’t elliptic curve cryptography different?
- dvdkhlng 7y agoNo, elliptic curve cryptography is not different, as it is based on the discrete logarithm problem [1]. That said, quantum computer resistant cryptography does exist, but is not currently in wide-spread use for various reasons. [1] https://en.wikipedia.org/wiki/Post-quantum_cryptography https://en.wikipedia.org/wiki/Post-quantum_cryptography
- jlgaddis 7y agoSlightly but, in reality, not really. > Early public-key systems are secure assuming that it is difficult to factor a large integer composed of two or more large prime factors. For elliptic-curve-based protocols, it is assumed that finding the discrete logarithm of a random elliptic curve element with respect to a publicly known base point is infeasible: this is the "elliptic curve discrete logarithm problem" (ECDLP). The security of elliptic curve cryptography depends on the ability to compute a point multiplication and the inability to compute the multiplicand given the original and product points. The size of the elliptic curve determines the difficulty of the problem. -- https://en.wikipedia.org/wiki/Elliptic-curve_cryptography https://en.wikipedia.org/wiki/Elliptic-curve_cryptography
- red_admiral 7y agoRun-of-the-mill ECC is just a new implementation of discrete-log cryptography, and falls pretty much immediately to a Shor-type quantum computer. Cryptosystems based on isogenies of elliptic curves are one form of (conjectured) post-quantum-secure cryptography.