Compression points in elliptic Montgomery and Edwards curves
Ismail Assoujaa, Siham Ezzouak · 2024
Compression point is a new way that allows efficient storage while still keeping the same amount of information. In this paper, we will focus on working with compression point to reduce the memory size. Usually, any points in elliptic curves are represented by two elements x and y of a finite field and thus require large memory size. So, these methods are divided into two main categories: x-point compression and y-point compression. We will work with elliptic curves in Weierstrass, Montgomery, and Edwards form, discussing their overall characteristics. In this paper, we present the state for all these methods with the cost of these operations compared with classical methods to help users choose the right method for each specific case.