3 ms·
My impression is that critical properties of these algorithms are not sufficiently understood/proven (in contrast to e.g. RSA), and that these are therefore ope
by tgv 4y ago
My impression is that critical properties of these algorithms are not sufficiently understood/proven (in contrast to e.g. RSA), and that these are therefore open to yet unknown attacks. Be careful with those secrets...
- computerfriend 4y agoSurprising contrast, since the security assumption of RSA is also not proven.
- tgv 4y agoIts properties are known. It’s safe until someone can efficiently factor large numbers.
- SAI_Peregrinus 4y agoThat statement relies on the unproven assumption that there's no faster way to solve the RSA problem than to factor the modulus.
- cvccvroomvroom 4y agoPrime factorization, matrix math, and elliptic curves are the primary "difficult" math problems we have to implement encryption. If there are any others, I'd like to know.
- 323 4y agoBut RSA will 100% be broken by quantum computers. So you have the possibility of new algorithms being broken to the certainty of RSA being broken.