How to use Double Compression point with scalar Double-and-Add in Elliptic curve

pl flag

refer to this paper Khabbazian Paper I am trying to use double point compression in scalar for example double-and-add with k=27 which need to reduce the multiplications process for example scalar double-and-add algo consumes 4 doubling and 3 addition for P1(3,10) based on this example example

I am thinking to take two points P1(3,10) P2(7,12) and compress to get P3(x1,x2,y1+y2) P3(3,7,22)which will be represent it in extra bit 0 because 22 is even number.

I don't know how this double compression point can reduce the number of multiplications process for K=27 or it's considered just as compress the point to save more space in memory?

Cisco Saeed avatar
pl flag
It based on this paper
fgrieu avatar
ng flag
The question's P1 and P2 are for curve $y^2\equiv x^3+a\,x+b\pmod p$ with $p=23$, $a=1$, $b=1$ of [that course]( Independently: the question refers to [that paper]('s _"Double Point Compression"_ representing two points $(x_1,y_1)$ and $(x_2,y_2)$ as three field elements and a bit, usually $(x_1,x_2,y_1+y_2)$ (the bit distinguishes another exceptional encoding; the question gets that bit wrong). That compression is _not_ the [standard one](
I sit in a Tesla and translated this thread with Ai:


Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.