Hi Santanu!
On 25 Aug., 18:03, Santanu Sarkar sarkar.santanu@gmail.com
wrote:
How to calculate inverse of a polynomial f(x) modulo g(x) in the finite
field GF(2^10)?
The usual way to compute modular inverses in a polynomial ring over a
field is the extended Euclidean algorithm, xgcd.
We
Dear Simon,
Thanks a lot.
With regards,
Santanu
On 25 August 2011 23:02, Simon King simon.k...@uni-jena.de wrote:
Hi Santanu!
On 25 Aug., 18:03, Santanu Sarkar sarkar.santanu@gmail.com
wrote:
How to calculate inverse of a polynomial f(x) modulo g(x) in the finite
field GF(2^10)?
Should this be a feature of an element of a finite field? As you point
out, it doesn't seem too hard to implement, and would seem to be an
important feature.
john perry
On Aug 25, 12:32 pm, Simon King simon.k...@uni-jena.de wrote:
Hi Santanu!
On 25 Aug., 18:03, Santanu Sarkar
This is already implemented in the sage i'm running (4.7.2.alpha2)
sage: P.x = GF(2^10,'z')[]
sage: p = P.random_element()
sage: q = P.random_element()
sage: p.inverse_mod(q)
(z^7 + z^6 + z^5 + z^4 + z^3 + z^2 + z)*x + z^2 + z
--
To post to this group, send email to
