News for hackers. Stuff that matters.
Re:Better-performing "25519" elliptic-curve cryptography by throw0101b on Friday September 13, 2024 @08:49AM (#41530744)
I would think that the (non-EC) Diffie-Hellman would also be easy enough to teach as well: exponentials and discrete log problem aren't any/much complicated than explaining factorization.

There are no comments on this comment yet.