I hope we can do this at Dage Days 6 in the next few days.
John
On 10/11/2007, Alex Ghitza <[EMAIL PROTECTED]> wrote:
>
> -BEGIN PGP SIGNED MESSAGE-
> Hash: SHA1
>
> Hi Martin,
>
> The link to which John pointed us gives a very easy way of computing the
> trace over F_q algebraically, wi
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi Martin,
The link to which John pointed us gives a very easy way of computing the
trace over F_q algebraically, without floating point arithmetic. All we
need to do is put John's one-liner PARI code in. I would love to do
this, but I don't know h
On Nov 8, 2007 11:54 PM, Martin Albrecht <[EMAIL PROTECTED]> wrote:
> > I agree. I actually started to implement this function, but never
> > submitted it because I saw someone else had beat met to it. One
> > should not have to provide the "degree" parameter--it should be
> > automatically deduce
> I agree. I actually started to implement this function, but never
> submitted it because I saw someone else had beat met to it. One
> should not have to provide the "degree" parameter--it should be
> automatically deduced (e.g. if E is over GF(p^n) with coefficents in
> GF(p^m), the computation
Hi all,
see
http://trac.sagemath.org/sage_trac/ticket/1120
and
http://trac.sagemath.org/sage_trac/ticket/1121
for the low hanging fruits.
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_www: http://www.informatik.uni-bremen.de/~ma
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi Martin, Robert, John,
I was not terribly happy with my implementation either, but thought I'd
put it in and keep working on it, or maybe that it would incite others
to fix it :)
I'll be happy to implement the changes suggested by you as soon as I
I thought this looked familiar! See my post at
http://pari.math.u-bordeaux.fr/archives/pari-users-0406/msg1.html
John
On 06/11/2007, John Cremona <[EMAIL PROTECTED]> wrote:
> You are right of course -- one should always compute the order over
> the smallest field of definition and then use
You are right of course -- one should always compute the order over
the smallest field of definition and then use the easy formula to get
the order of E(GF(q^d)) from that of E(GF(q)).
While you are at it you should not stop at the smallest field
containing the coefficients of the given curve, it
On Nov 6, 2007, at 11:09 AM, Martin Albrecht wrote:
> I stumbled over #262
>
> http://trac.sagemath.org/sage_trac/ticket/262
>
> again. Here Graeme Taylor proposes his implementation of point
> counting of
> elliptic curves over GF(p^n) with coefficients in GF(p) in
> Weierstrass form.
>
>
