On Jun 21, 12:02 pm, Simon King <[email protected]> wrote:
> Could your problem be similar?
Thanks, Simon! That was the nudge I needed. But just a bit more
subtle this time. Chasing through the factorization code leads one to
sage: F.<d> = GF(3^2)
sage: d._pari_()
Mod(d, Mod(1, 3)*d^2 + Mod(2, 3)*d + Mod(2, 3))
sage: d._pari_init_("m")
'Mom(m, Mom(1, 3)*m^2 + Mom(2, 3)*m + Mom(2, 3))'
sage: d._pari_init_("p")
'Mop(p, Mop(1, 3)*p^2 + Mop(2, 3)*p + Mop(2, 3))'
sage: d._pari_init_("b")
'Mob(b, Mob(1, 3)*b^2 + Mob(2, 3)*b + Mob(2, 3))'
So "d", "o" and "M" are bad choices for generators of finite fields
(at least when implemented with givaro).
Looks like it is easy to fix, hints at
http://trac.sagemath.org/sage_trac/ticket/11530
Rob
--
To post to this group, send an email to [email protected]
To unsubscribe from this group, send an email to
[email protected]
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: http://www.sagemath.org
