TO W. Stein:
Thanks.
That was what I needed.
SAGE is a great piece of software.
I'm using it in some adv math and cryptography classes.
TO J. Palmieri:
Yes I know you can do that. But you get into minor annoyances (which you can
code around) such as E.points().
On 5/4/09, William Stein wrote:
On Mon, May 4, 2009 at 1:07 PM, gtg wrote:
>
> Hi I'm new to sage. Can you tell me how to construct finite fields
> using quotient of poly ring? For instance suppose I want to construct
> GF(5^2) using a GF(5) poly ring mod out by x^2 + x + 1 how do I do
> that? I can construct the quotient like
On May 4, 1:07 pm, gtg wrote:
> Hi I'm new to sage. Can you tell me how to construct finite fields
> using quotient of poly ring? For instance suppose I want to construct
> GF(5^2) using a GF(5) poly ring mod out by x^2 + x + 1 how do I do
> that? I can construct the quotient like this:
>
> p = 5
