Comment by edflsafoiewq
12 hours ago
You also need the group structure, ie. a(bG) = b(aG) = (ab)G.
But AFAICT, elliptic curve groups really are the best known groups where DH is hard. The "Why curves win" section talks about it terms of key size, but the reason other groups require larger keys is they have some kind of structure which can be exploited to attack the "hard" direction (eg. in a finite field, the ability to factor over primes can be used to solve discrete logs), so the group size has to go up to compensate.
No comments yet
Contribute on Hacker News ↗