#10562: class ECPP added to sage: provides primality proving via
Goldwasser-Kilian
and Atkin-Morain (ECPP)
--------------------------------+-------------------------------------------
Reporter: ghahn@… | Owner: was
Type: enhancement | Status: needs_review
Priority: major | Milestone:
Component: number theory | Keywords: ecpp, goldwasser, kilian,
primality, proving
Author: Georg Hahn | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
--------------------------------+-------------------------------------------
Comment(by ghahn@…):
Hi,
thanks for your helpful comment! I didn't know about the is_prime() call
within the EllipticCurve constructor. Up to now, I haven't noticed any
slowdown due to EllipticCurve() (although I haven't paid attention
either...).
Isn't it the case that is_prime() switches over to a pseudoprimality test
as soon as the input number exceeds a certain bound (which will be
probably the case for numbers tested via ECPP) and is thus very fast
again? If not, it would indeed make the code pointless somehow (as
computations on elliptic curves are vital for ECPP and it wouldn't make
that much sense to me to re-implement EllipticCurve, Schoof-Elkies-Atkin
etc just for this single file ecpp.pyx)
Best,
Georg
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10562#comment:10>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
