0% found this document useful (0 votes)
12 views

Projective Coordinates of Elliptic Curves

The document discusses the use of projective coordinates in elliptic curve cryptography (ECC) to reduce the computational cost of point addition and doubling, which are expensive operations in affine coordinates due to the need for field inversions. It explains the transformation from affine to projective coordinates and introduces Jacobian projective coordinates, which eliminate the need for inversions while requiring more multiplications and squarings. Overall, projective coordinates enhance efficiency in ECC by minimizing costly operations.

Uploaded by

jmsbaihi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
12 views

Projective Coordinates of Elliptic Curves

The document discusses the use of projective coordinates in elliptic curve cryptography (ECC) to reduce the computational cost of point addition and doubling, which are expensive operations in affine coordinates due to the need for field inversions. It explains the transformation from affine to projective coordinates and introduces Jacobian projective coordinates, which eliminate the need for inversions while requiring more multiplications and squarings. Overall, projective coordinates enhance efficiency in ECC by minimizing costly operations.

Uploaded by

jmsbaihi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

Projective Coordinates of

Elliptic Curves
Introduction
- In elliptic curve cryptography (ECC), field inversion is the
most computationally expensive operations. When using
affine coordinates, every point addition and doubling requires
at least one inversion, making these operations costly.
Affine Coordinates
- The standard coordinates represented using (x, y ) with x, y ∈ F are
called affine coordinates

- Affine curve equation: y^2 = x^3 + ax + b

- The affine point addition formulae for adding P = (x1 , y1 ) and Q = (x2 ,
y2 ) to obtain R = (x3 , y3 ) were given as
Affine Coordinates

- We see that the affine addition formulae requires:


- 1 inversion,
- 2 multiplication
- 1 squaring
Projective Coordinates

● In the projective system, the third coordinate z is in a way redundant

● It is not necessary, and it can be derived from the other two coordinate
values x and y

● However, the projective coordinates allow to reduce the number of finite field
operations required for point addition and doubling
Projective Coordinates

● Affine curve equation: y^2 = x^3 + ax + b

● The curve equation: y^2z = x^3 + axz^2 + bz^3


● The relation to the affine: (x : y : z) → (x/z, y /z)
● The name: Projective

● The curve equation: y^2 = x^3 + axz^4 + bz^6


● The relation to the affine: (x : y : z) → (x/z^2 , y /z^3 )
● The name: Jacobian
Jacobian Projective Coordinates
● As explained, to avoid (multiplicative) inversions in the point addition, points
on elliptic curves are usually represented with projective coordinate systems

● In Projective coordinates, a point P = (x1 , y1 ) is represented using the


triplet (x1 : y1 : z1 ) = (λx1 : λy1 : λ) for some nonzero λ

● A projective homogeneous point (x1 : y1 : z1 ) with z1 != 0 corresponds to


the affine point (x1 /z1 , y1 /z1 )

● (x1 : y1 : z1 ) ↔ (x1 /z1 , y1 /z1 )


Point Addition in Jacobian Projective
Coordinates
● the addition of P = (x1 : y1 : z1 ) and Q = (x2 : y2 : z2 ) with Q != ±P and P,
Q != O is given by R = (x3 : y3 : z3 ) such that

● the temporary values are:


Point Addition in Jacobian Projective
Coordinates

● The addition of two points requires


○ 12 multiplication
○ 4 squaring operations
○ no inversion
Point Addition in Jacobian Projective
Coordinates

● The addition of two points requires


○ 12 multiplication
○ 4 squaring operations
○ no inversion
computational costs of different
coordinate systems

You might also like