[sage-support] Re: GF(2n) to GF(2) ANF

2014-08-22 Thread Juan Grados
I'm see that substitution is very slow in SAGE for many many. Is there any way to get best perfomance to substitution? thanks 2014-08-22 7:42 GMT-03:00 Juan Grados : > I'm wrote a method to get the symbolic coefficients of polynomial p \in > GF(2^pp)[X0,...,X_{nvars-1}] translate to GF(2). The m

Re: [sage-support] Re: GF(2n) to GF(2) ANF

2014-08-23 Thread Vincent Delecroix
I do not understand why you are using the symbolic ring and not a polynomial ring (in several variables). The symbolic ring is very slow for everything. I did not fully understand your question, but here at least is an example involving polynomial rings sage: K = GF(2) sage: n=4; R = PolynomialRi