Blog

Setting aside the reasoning why we are building an algebraic system using points of elliptic curves (we will get into that later on), we omitted some bad things that can happen when applying the rules for point addition and doubling. We did this on purpose as it would be too confusing for some readers. But now the time has come and we can look at these problematic cases to find something new: the point at infinity.

After the introduction of the first two simple point operations on elliptic curves in simple Weierstrass form, we can now look at some more interesting operations available to us. Last of the three "primitive" operations specified for points of the elliptic curve is the point doubling operation. It should be the same as if we wanted to sum not two distinct but rather two equal points. As usually, I would like to encourage anyone to give me a feedback, especially about the visualizations used.

Another week, another point operation on elliptic curves. This time we are about to explore a simple point addition of two different points on elliptic curve in simple Weierstrass form. Although there are still some possibilities of enhancing the visualizations, our focus is now on finishing this series to a point where we can show at least Diffie-Hellman key exchange[1].

Venturing closer to our goal of using elliptic curves for digital signatures and encryption, we describe the simplest point operation on elliptic curve in Weierstrass form. This operation is called negation and it somehow resembles the negation of numbers you learned about in elementary school. We have (sort of) finalized the software stack for visualizing elliptic curves both in 2D or 3D so I would like to hear some feedback if the pictures - and especially the video - are clear and easy to understand. And now for something completely negating...

After a quick introduction to simple elliptic curves used in cryptography and finally for securing our online communication, we cannot move forward without solving one major problem. How to represent these curves, and all of their points thereof, in computer memory. Why this is a major problem? There is an infinite number of real numbers, but computers can store only a finitely-sized things - including numbers. I'd like to explain how we can overcome this inherent trouble and show you that anyone can understand these modern cryptographic fundamentals.