@wolf480pl I studied elliptic curves recently and I found the math behind them beautiful. Also, at least part of it (namely, modular arithmetic) is not that hard to explain or grasp.
@wolf480pl I haven't studied RSA as deeply (so I'm willing to be proved wrong), but it always seemed to me that the security it offered was based mostly on the size of the key, which made me distrustful of the underlying algorithm. “Computing power is catching up to us! Quick! Use bigger primes!”
@josemanuel that's true with every algo tho?
@wolf480pl It is, of course, but EC algorithms use much smaller keys for an equivalent level of security.
@josemanuel yeah, they're better by a constant factor, and that constant factor is quite useful in practice
@josemanuel yeah but like, look at Schnorr or ElGamal signature vs RSA signature.
I can understand why Schnorr and Elgamal verify correctly after a few minutes of thinking. Meanwhile, RSA is obvious on 1st sight.