Ask Your Question

Christian_Kossmann's profile - activity

2014-06-29 18:55:47 +0200 received badge  Popular Question (source)
2014-06-29 18:55:47 +0200 received badge  Notable Question (source)
2014-06-29 18:55:47 +0200 received badge  Famous Question (source)
2013-04-29 04:11:11 +0200 received badge  Student (source)
2013-04-28 08:58:45 +0200 received badge  Scholar (source)
2013-04-28 08:58:45 +0200 marked best answer Modular reduction in Galois fields

First, define k to be the field GF(2^5), whose generator is named a:

sage: k.<a> = FiniteField(2^5); k
Finite Field in a of size 2^5

Alternatively :

sage: k = GF(2^5, 'a'); k
Finite Field in a of size 2^5

Then, define the polynomial ring k[x]:

sage: R.<x> = PolynomialRing(k); R
Univariate Polynomial Ring in x over Finite Field in a of size 2^5

Alternatively:

sage: R = k['x']; R
Univariate Polynomial Ring in x over Finite Field in a of size 2^5

Then, do your computation in R:

sage: P = R(x^6)
sage: P.mod(x^5+x^2+1)
x^3 + x
2013-04-28 08:58:42 +0200 commented answer Modular reduction in Galois fields

Thank you very much - helped me a lot!

2013-04-28 08:53:55 +0200 received badge  Supporter (source)
2013-04-28 07:04:04 +0200 asked a question Modular reduction in Galois fields

I want to compute x^6 mod x^5+x^2+1 in the Galois Field GF(2^5). Does anyone know how to do this in SAGE?