Tutorial 5b ECC Over Finite Field 299
Tutorial 5b ECC Over Finite Field 299
This ECC is by far the most efficient elliptic curve cryptosystem and it is part of An ECC
standard.
An elliptic curve E over F[2m] is given by
y2 + xy = x3 + ax2 + b modulo M(t).
y2 + xy = x3 + 3x2 + 4
0
-4 -2 0 2 4
-2
-4
Figure 5.1 An example of an algebraic elliptic curve
Let us take x1=2, y1=100+i, where i is the last 2 digits of your matrix number or newly assigned
number. Take a=3, compute b.
We will always compute in a ring modulo M=29910. = 1001010112.
Table 5.1 An inverse a1 of a = xy in hexa modulo irreducible polynomial 29910 = M(t) =
t8+t5+t3+t+1 written in hexadecimals.
a1 y
0 1 2 3 4 5 6 7 8 9 A B C D E F
0 00 01 95 E6 DF BB 73 A4 FA 85 C8 55 AC CE 52 69
1 7D 27 D7 F8 64 59 BF A3 56 50 67 9A 29 33 A1 98
2 AB 91 86 E8 FE E1 7C 11 32 1C B9 30 CA 76 C4 3D
3 2B B8 28 1D A6 B1 4D 3F 81 61 8C 5A C5 2F 4C 37
4 C0 F4 DD 44 43 DC 74 FC 7F 8F E5 C6 3E 36 9D DA
5 19 57 0E 68 C9 0B 18 51 65 15 3B 8D 62 97 8B 6F
6 80 39 5C 96 14 58 9B 1A 53 0F CD D9 B3 9E 8A 5F
x 7 D5 F2 A5 06 46 FD 2D CB F7 E2 82 ED 26 10 8E 48
8 60 38 7A EC FB 09 22 E9 B4 C2 6E 5E 3A 5B 7E 49
9 AA 21 D2 B7 E7 02 63 5D 1F A0 1B 66 DB 4E 6D B2
A 99 1E BE 17 07 72 34 B0 F1 EF 90 20 0C CF BD D1
B A7 35 9F 6C 88 C3 D3 93 31 2A DE 05 D0 AE A2 16
C 40 F5 89 B5 2E 3C 4B E4 0A 54 2C 77 D8 6A 0D AD
D BC AF 92 B6 F3 70 F9 12 CC 6B 4F 9C 45 42 BA 04
E FF 25 79 F6 C7 4A 03 94 23 87 EB EA 83 7B F0 A9
F EE A8 71 D4 41 C1 E3 78 13 D6 08 84 47 75 24 E0
=10001110
10001110
10001110
100011100
=100000001010100
100101011
101010010100
100101011
1111001100
100101011
110011010
100101011
10110001= B116.
x1 y1 = 1010001110
=100011100
100101011
= 110111 = 3716.
x3 = x x2 = t t2 = t3 = 10002.
10100
= 10002 = 0816.
= 10110001
110111
1000
1100
= 10000010 = 8216.
Let (x1, y1) be a point on an elliptic curve E(F2m), and (x1, y1) (x2, –y2)
then let (x2, y2) = 2(x1, y1) such that
b y1
x 2 =x21 + and y 2 =x 21 +( 1+ x 1 + )⋅x 2
x 21 x1
From x12 = 1002, refer to Table 5.1 in xy =04, we get an inverse x12 =DF=110111112.
Let us compute
bx12 = 82DF
= 1000001011011111
= 11011111
110111110
110111000111110
100101011
10010011111110
100101011
110011110
100101011
= 10110101=B516
From x1 = 102=216, refer to Table 5.1 in xy=02, we get an inverse x11 =9516.
Let us compute
y1 x11 = 8E95
= 1000111010010101
= 10010101
10010101
10010101
100101010
= 100110101010110
100101011
11110010110
100101011
1100111010
100101011
101101100
100101011
1000111=4716.
1
Next 1 + x1 + y1 x1 = 1+10+1000111
= 1000111
10
+ 1
1000100=4416.
Let (x1, y1) and (x2, y2) are two points on an elliptic curve E(F2m), and
(x1, y1) (x2, y2)
then let (x3, y3) = (x1, y1) (x2, y2) such that
( ) ( )
y 2− y 1 2 y 2− y 1 y −y
x 3= + −( x 1 +x 2 )+a and y 3 = 2 1 ( x1 −x 3 )−( x3 + y 1 )
x 2 −x 1 x2 −x 1 x2 −x 1
x1 – x3=02 – B2=B016.
x3 + y1=B2 + 8E=3C16.