On Fri, Jul 23, 2010 at 5:45 AM, G Hahn <gh...@cantab.net> wrote:
> Hi all,
>
> does somebody know if there is already a Cython code for Goldwasser-
> Kilian/ Atkin-Morain (primality proving using elliptic curves) in
> SAGE? I heard that SAGE currently imports PARI code for that.
Yes, Sage only includes what PARI's isprime includes, which is:
? ?isprime
isprime(x,{flag=0}): true(1) if x is a (proven) prime number, false(0)
if not. If flag is 0 or omitted, use a combination of algorithms. If
flag is 1, the primality is certified by the Pocklington-Lehmer Test.
If flag is 2, the primality is certified using the APRCL test.
> In case
> there's no Cython code, I'd like to contribute those algorithms.
> Thanks, Georg
>
> --
> To post to this group, send an email to sage-devel@googlegroups.com
> To unsubscribe from this group, send an email to
> sage-devel+unsubscr...@googlegroups.com
> For more options, visit this group at
> http://groups.google.com/group/sage-devel
> URL: http://www.sagemath.org
>
--
William Stein
Associate Professor of Mathematics
University of Washington
http://wstein.org
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: http://www.sagemath.org
