MATH 470 Lecture 24

From Notes
Jump to navigation Jump to search

« previous | Tuesday, April 16, 2013 | next »


Recall

  • 𝔽p, where p is prime, represents a prime field
  • 𝔽q, where q is a prime power not a prime, represents a finite extension field.

Consider 𝔽27 realized as 𝔽3[T]/T3+2T+1.

We need to check that T3+2T+1 is irreducible (i.e. it has no non-trivial roots)

If it had a non-trivial factorization, it would be (linear) × (quadratic)

t t3+2t+1
0 1
1 1
2 1

Therefore there are no roots mod 3.

Therefore, 𝔽3[T]/T3+2T+1 is a realization of 𝔽33=𝔽27

Inverses

What is 1T+1 in this realization of 𝔽27?

It would be the polynomial p(T)𝔽3[T] with p(T)(T+1)=1.

This is equivalent to finding polynomials p(T),q(T)𝔽3[T] with p(T)(T+1)+q(T)(T3+2T+1)=1.

When working with integers, we had the extended Euclidean algorithm. We can still use it, but we need a few modifications:

[1001a(T)b(T)][*(T)u(T)*(T)v(T)01]

Our goal is to make a and b smaller in degree (rather than absolute value, as we did with integers).

Example

To compute 1T+1 in the above realization of 𝔽27, we do...

[1001T+1T3+2T+1][1T201T+1T2+2T+1][1T2+T01T+13T+1][1T2+T301T+12][12T2+T01T+11]

Therefore, (2T2+T)(T+1)+(1)(T3+2T+1)=1, and 1T+1=2T2+T in this 𝔽27.

Note that there are possibly many distinct realizations of 𝔽q: this is why the irreducible polynomial must be clarified!

Is T3+2T+1 primitive over 𝔽3? (i.e. do the powers 1,T,T2,,T26=𝔽27*?

What do we know about the order of T in 𝔽27*.

Recall: the order of T in a field 𝔽q would be the smallest k with Tk=1 in 𝔽q

Lagrange's Theorem

Implies that the order of any T𝔽q* must divide the cardinality (number of elements) of 𝔽q*.

The cardinality of 𝔽q* is q1, so order(q1)

For our realization of 𝔽27, the order could be 1, 2, 13, or 26

  • order of T is not 1 since T1 in this realization.
  • order of T is not 2 since all 27 elements in this realization are distinct
  • order of T is not 13 since T13=2
  • Therefore, by elimination, the order of T is 26

Therefore, T3+2T+1 is primitive over 𝔽3:

Elements of 𝔽27 realized by 𝔽3[T]/T3+2T+1
n Tn Tn(modT3+2T+1)(mod3)
0 1 0
1 T T
2 T2 T2
3 T3 2T1T+2
4 T4 T2+2T
5 T5 (T+2)+2T22T2+T+2
6 T6 (T+2)(T+2)T2+T+1
7 T7 (T+2)+T2+TT2+2T+2
8 T8 (T+2)+2T2+2T2T2+2
9 T9 (T+2)3(T+2)+2T+1
10 T10 T2+T
11 T11 (T+2)+T2T2+T+2
12 T12 (T+2)+T2+2TT2+2
13 T13 (T+2)+2T2
14 T14 2T
15 T15 2T2
16 T16 2(T+2)2T+1
17 T17 2T2+T
18 T18 2(T+2)+T2T2+2T+1
19 T19 (T+2)+2T2+T2T2+2T+2
20 T20 2(T+2)+2T2+2T2T2+T+1
21 T21 2(T+2)+T2+TT2+1
22 T22 (T+2)+T2T+2
23 T23 2T2+2T
24 T24 2(T+2)+2T22T2+2T+1
25 T25 2(T+2)+2T2+T2T2+1
26 T26 2(T+2)+T1

In sage,

k = GF(3^3, 'T') for i,x in enumerate(k): print i,x

Elliptic Curves

Consider elliptic curve E:y2=x3+x+1 over 𝔽q realized as 𝔽3[9]/T22T2+1


First: what are the squares in (this) 𝔽9?

x or y y2 x3+x+1
0 0 1
1 1 0
2 1 2
T 2* 1
T+1 2T 0
T+2 T 2
2T 2 1
2T+1 T 0
2T+2 2T 2

* Note: 2 has no square root mod 3, but 2=±T in this 𝔽9

The points in this 𝔽9 of E are:

  • (0,±1)
  • (1,0)
  • (2,±T)
  • (T+1,0)
  • (T+2,±T)
  • (2T,±1)
  • (2T+1,0)
  • (2T+2,±T)

There is also the point at infinity for a grand total of 16 points.


Hasse's Theorem

(1933)

If E is any elliptic curve, over 𝔽q with n points, then

|n(q+1)|2q

(conjectured by Emil Artin in his 1924 Ph.D. thesis, and ultimately led to P. Deligne winning a fields medal in 1974 for the riemann hypothesis for function fields)

This comes from the strange connection between finite fields and complex numbers in Genus 1

For our E, we get that n=16, so

|16(9+1)|29|6|23

And this checks out.

Furthermore, Hasse's theorem implies that over 𝔽9, the number of points must be between 4 and 16.


Addition Law

How does the addition law work here? (e.g. (1,0)(2,T)= ?)

Recall:

When adding two points (x,y)(x,y)=(𝕏,𝕐),

Let m={3x2+12yx=xyyxx, 𝕏=m2xx, and 𝕐=m(x𝕏)y

So going back to our example, (1,0)(2,T), we get

  • m=T021=T
  • 𝕏=T212=T2=2
  • 𝕐=m(x𝕏)y=2T

and (1,0)(2,T)=(2,2T)