Scribd
Upload
103 views6 pages

Elliptic Curve Cryptography

This document provides examples of finding points on elliptic curves over finite fields. It contains the following key points: - Example 10.14 defines an elliptic curve over GF(13) and identifies some points on the curve, including that inverse points have additive inverse y-values. - Example 10.15 shows how to add two points on the curve over GF(13), finding the point (11,2) as the sum of (4,2) and (10,6). - Elliptic curves are meant to be used over finite fields of characteristic greater than 3. - Example 10.16 defines an elliptic curve over GF(23) and identifies some points on the curve. Example 10

Uploaded by

iayan06es03
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
103 views6 pages

Elliptic Curve Cryptography

This document provides examples of finding points on elliptic curves over finite fields. It contains the following key points: - Example 10.14 defines an elliptic curve over GF(13) and identifies some points on the curve, including that inverse points have additive inverse y-values. - Example 10.15 shows how to add two points on the curve over GF(13), finding the point (11,2) as the sum of (4,2) and (10,6). - Elliptic curves are meant to be used over finite fields of characteristic greater than 3. - Example 10.16 defines an elliptic curve over GF(23) and identifies some points on the curve. Example 10

Uploaded by

iayan06es03
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 6

FOUROZON

Finding Points on the Curve


Algorithm 10.12 shows the pseudocode for finding
the points on the curve Ep(a, b).

Example 10. 14
Define an elliptic curve E13(1,1). The equation is y2 = x3
+ x + 1 and the calculation is done modulo 13.
Figure 10.14 Points on an elliptic
curve over GF(p)

Some values of y2 do not have a square root in modulo 13


arithmetic. These are not points on this elliptic curve. x =
2,3,6,9
Each point defined for the curve has an inverse.
For a pair of inverse points, the y values are additive inverses of
each other in Zp. For example, y = 4, -y = 9
The inverses are on the same vertical lines.

Example 10.
15 us add two points in Example 10.14, R = P + Q, where
Let
P = (4, 2) and Q = (10, 6).
a. = (6 2) (10 4)1 mod 13 = 4 61 mod 13 = 5 mod
13.
b. x = (52 4 10) mod 13 = 11 mod 13.
c. y = [5 (4 11) 2] mod 13 = 2 mod 13.
d. R = (11, 2), which is a point on the curve in Example 10.14.

Restriction

The elliptic curve (y2 = x3 + ax + b) is meant to be


used only when the underlying finite field is of
characteristic greater than 3.

Example 10. 16

We choose GF(23) with elements {0, 1, g, g2, g3, g4, g5, g6}
using the irreducible polynomial of f(x) = x3 + x + 1, which
means
that
g3 + g + 1 = 0 or g3 = g + 1. Other powers of g can be
calculated
accordingly. The following shows the values of the gs.

10.4

Example 10. 16Continued


Using the elliptic curve y2 + xy = x3 + g3x2 + 1, with a = g3
and
b = 1, we can find the points on this curve, as shown in
Figure 10.15.

Figure 10.15 Points on an elliptic curve over GF(2n)

Example 10.
17

Let us find R = P + Q, where P = (0, 1) and Q = (g2, 1).


We have = 0 and R = (g5, g4).
Example 10.
18 us find R = 2P, where P = (g 2, 1). We have = g2 +
Let

1/g2
= g2 + g5 = g + 1 and R = (g6, g5).

You might also like