Ask Your Question

Wimet's profile - activity

2023-01-10 16:50:44 +0200 received badge  Student (source)
2023-01-10 16:50:28 +0200 received badge  Popular Question (source)
2022-05-28 12:30:39 +0200 commented answer Computing the inverse of a generic element in a finite field extension

Thank you very much! I think that there is a missing line of code that defines the "X". Something like: P.<X> = P

2022-05-26 20:07:02 +0200 marked best answer Computing the inverse of a generic element in a finite field extension

I am working in the following field extension:

p = 2**64-2**32+1
P.<X,A,B,C> = PolynomialRing(GF(p))
GF.<x,a,b,c> = P.quotient_ring(X^3-X-1)

My objective is to take a generic element of this field p(x) = a + b*x + c*x^2 and compute its inverse, where its coefficients are a function of a,b,c.

However, if I try to directly do it:

q = x^2
qinv = 1 / q

I get a singular error. I get an error (ArithmeticError: Division failed. The numerator is not a multiple of the denominator.) if I change the prime to, say, 5. If I do not use the variables to express the generic coefficients of p(x), then clearly it works, but I do not get the desired result.

Is there any way I can achieve what I need?

2022-05-26 20:07:02 +0200 received badge  Scholar (source)
2022-05-26 14:06:34 +0200 asked a question Computing the inverse of a generic element in a finite field extension

Computing the inverse of a generic element in a finite field extension I am working in the following field extension: p