- 1 year
Well, finally a page where you have to block even inline scripts to be unbothered by cookie banners.
And it somehow still lags while scrolling!
- azolus@slrpnk.netEnglish1 year
Edit: Lemmy somehow converts all my ^ symbols to
<sup>and</sup>for whatever reason. My apologiesIn simple terms, an elliptic curve is just the set of points satisfying an elliptic curve equation of form
y^2 = x^3 + a*x + b. We say a point is “on the curve” if it satisfies the given equation. The parametersaandbare some “numbers” (often over a finite field—if that doesn’t ring a bell, just ignore it. It’s not important for now) and constant for any specific elliptic curve.So let’s say we have the following equation
y^2 = x^3 + x + 6The point
(2, 4)would be on the curve, since we can plug in2forxand4foryand verify that the equality does in fact hold, since we get4^2 = 16on the lefthand side and2^3 + 2 + 6 = 8 + 2 + 6 = 16on the righthand side.
Through some mathematical trickery we can also perform operations on the curve, i.e. “add” two points. This is not as straight forward as let’s say standard arithmetic, where you just add numbers as per usual, but we can in fact define an operation that combines two points on the curve to yield another point on the curve cleanly. The process is very ugly when you look at the formula but there is some nice visual intuition for it:

We have a curve (red) and two points:
PandQ. Focus only on the left image for now. We draw a line through bothPandQand see where that line has its third intersection point with the curve. On the left most picture that would be the pointR. We takeRand mirror it down (imagine putting a mirror along thex-axis, thex-coordinate ofRstays the same but they-coordinate gets flipped). I very expertly drew in that new point in green. And that’s it! That’s our result of addingPandQ.The pictures 2, 3 and 4 are a bit weird. In those, we don’t get a third intersection point with the curve. In these special cases we say the result is
O—sort of a point at infinity. Don’t think too hard about what that means, it’s just a mathematical trick to deal with the edge-cases. We do this by saying that the result of addition isOif we don’t get a third intersection point with the curve. Adding any pointPtoOgets youPback. SoOis basically our zero for addition.
This type of “addition” then allows us to perform “calculations” by using the operation defined by the curve. Doing so we can formulate more complicated problems—where finding a solution is very difficult but verifying a solution is easy. This is the basis for their usefulness in cryptography, since we want to be able to encrypt easily but make decrypting without a given key very very difficult.
Hope that helps!