Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
throw0101b
on Sept 13, 2024
|
parent
|
context
|
favorite
| on:
Better-performing “25519” elliptic-curve cryptogra...
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.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: