|
|
|
|
|
|
by anderskaseorg
1843 days ago
|
|
|
The security of elliptic curve cryptography is based on discrete logarithms; there’s nothing to factor. Until we get very large quantum computers, the best known attacks are brute force searches taking about 2^128 steps for a 256-bit elliptic curve, which is far outside the realm of practical. |
|
|