Score:0

Multiplication two points in elliptic curve cryptography

pk flag

Are there references or prove to say that multiplying two points in the elliptic curve cryptography ECC is not allowed, as an example below? Multiply the public key PKA by a point (Z) on the ECC since these two parameters (the public key and the point) are both points on the ECC.

  • $C=′\oplus h(Z.PK_A\mathbin\|T_1)$
  • $Pk=[SK]P$
  • $Z=[a]P$

where $P$ is a base point on an EC and $a\in\mathbb Z_q^*$.

kelalaka avatar
in flag
[How do I multiply two points on an elliptic curve?](https://crypto.stackexchange.com/q/88214/18298). It is scalar multiplication and points of EC can only form a Z-Module!
knaccc avatar
es flag
The purpose of the elliptic curve is that it provides a trapdoor function. Why is that trapdoor function (scalar multiplication) not enough for your purposes? Anything that you devised with two points would be an entirely different kind of "multiplication".
kelalaka avatar
in flag
Does this answer your question? [How do I multiply two points on an elliptic curve?](https://crypto.stackexchange.com/questions/88214/how-do-i-multiply-two-points-on-an-elliptic-curve)
Score:0
sd flag

Adding points within an elliptic curve group will give another point to the curve and all multiples of the points within the group will also be contained in the elliptical curve. There are three rules for adding points within an elliptical curve group that are followed:

  1. ∞ + ∞ = ∞
  2. (χ, γ) + ∞ = (χ, γ)
  3. (χ, γ) + (χ, -γ) = ∞

scalar multiplication of points in elliptic curves above GF (p) are calculated by the following formulas A) Addition of points Let be two points on the curve P = (x1, y1) and Q = (x2, y2) and their sum is R = (x3, y3). P and Q are distinguished if P and -Q are not the same (x1 ≠ x2). Adding the points, P + Q = R is defined as: (x1, y1) + (x2, y2) = (x3, y3) λ = (y2 - y1) (x1 - x1) -1 x3 = λ2 –x1 –x2 y3 = λ (x1- x3) - y1

Β) Doubling of a point Let the point P = (x1, x2) exist in the curve where x1 ≠ 0. The doubling of the point, 2P = R is defined as: (x1, y1) + (x1, y1) = (x3, y3) λ = (3x12 + a) (2y1) -1 x3 = λ2 –2x1 y3 = λ (x1- x3) - y1

C) Scalar multiplication of points Let P be a point and d be a bit string of an integer. In order to calculate the point Q = dP, combined methods of adding and doubling the points are used. The multiplication of a point, dP = Q, follows the following algorithm: if dn-1 = 1, then Q: = P else Q: =  for i = n-2 to 0 Q: = Q + Q if di = 1 then Q: = Q + P return Q

kelalaka avatar
in flag
This doesn't address [the misinformation of bitcoin books etc](https://crypto.stackexchange.com/a/96056/18298). OP intension is to multiply points.
Pegasus avatar
sd flag
I’ve agree regarding the misinformation. I’ve was trying to cover numerical functions in elliptic curves.
kelalaka avatar
in flag
We have many answers containing that...
mangohost

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.