Citation Hunt

Leaderboard

The Wikipedia snippet below is not backed by a reliable source. Can you find one?

Click I got this! to go to Wikipedia and fix the snippet, or Next! to see another one. Good luck!

In page Elliptic-curve cryptography:

This text has been unreferenced on Wikipedia for a very long time. If you can't find a source, be bold and remove it!

"

Shor's algorithm can be used to break elliptic curve cryptography by computing discrete logarithms on a hypothetical quantum computer. The latest quantum resource estimates for breaking a curve with a 256-bit modulus (128-bit security level) are 2330 qubits and 126 billion Toffoli gates.[1] For the binary elliptic curve case, 906 qubits are necessary (to break 128 bits of security).[2] In comparison, using Shor's algorithm to break the RSA algorithm requires 4098 qubits and 5.2 trillion Toffoli gates for a 2048-bit RSA key, suggesting that ECC is an easier target for quantum computers than RSA. All of these figures vastly exceed any quantum computer that has ever been built, and estimates place the creation of such computers at a decade or more away.[citation needed][3]