4 ms·
Sounds like tinfoil hat. Afaict RSA is simpler to crack with quantum computers than ECC.
by willis936 5y ago
Sounds like tinfoil hat. Afaict RSA is simpler to crack with quantum computers than ECC.
- deadbeeves 5y agoNo, the discrete logarithm problem and the prime factoring problem are very similar and are both solved by Shor's algorithm. I suspect they might actually be equivalent, in a weird way.
- nwallin 5y ago> Afaict RSA is simpler to crack with quantum computers than ECC. RSA requires 2n qubits to crack, ECC requires 6n. Since the normal RSA key is 2048 bits, and the normal ECC key is 256 bits, RSA requires a 4096 qubit quantum computer, and ECC requires a 1536 qubit quantum computer. If you use 4096 bit RSA and 512 bit ECC keys, this becomes 8192 qubits and 3072 qubits respectively. I'm not aware of any ECC curves larger than 512 bits. Ultimately, both are broken in a post-quantum world. However, in the interim-quantum world, where quantum computers exist but are noisy and unreliable, RSA is safer.
- dolni 5y agoAfter Snowden blew the whistle on government domestic surveillance, THIS rises to the level of tinfoil hat for you?