I'm really not into math and got really lost in the second half of "Adding points on a curve". Just don't understand what the author wants to tell me with the grouping and the role of the identity element, which is called infinity but is zero?
However, after looking at the next section and playing with the chart I immediately got the idea where the whole article is heading. Interesting to see how this works.
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.
I'm really not into math and got really lost in the second half of "Adding points on a curve". Just don't understand what the author wants to tell me with the grouping and the role of the identity element, which is called infinity but is zero?
However, after looking at the next section and playing with the chart I immediately got the idea where the whole article is heading. Interesting to see how this works.
Seeing the below error when visiting the site.
“This site can’t provide a secure connection
growingswe.com sent an invalid response.
ERR_SSL_PROTOCOL_ERROR”
there must be tons of functions that are easy to process one way but almost impossible the other.
i get the feeling there is more to it than finding such a function, but the article doesnt get into that
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.
Would there not be an infinite number?