#16304: Non-deterministic ordering of GMP-ECM output
-------------------------------------------------+-------------------------
Reporter: pbruin | Owner:
Type: defect | Status: new
Priority: minor | Milestone: sage-6.2
Component: interfaces | Resolution:
Keywords: gmp-ecm elliptic curve | Merged in:
factoring | Reviewers:
Authors: | Work issues:
Report Upstream: N/A | Commit:
Branch: | Stopgaps:
Dependencies: |
-------------------------------------------------+-------------------------
Comment (by zimmerma):
indeed, the closer the (smallest) factors, the higher is the probability
that the factor
found is non-deterministic:
{{{
sage: f = ECM()
sage: n=6366805760909033411615543376840901
sage: f.find_factor(n)
[79792266297612017, 79792266297612053]
sage: f.find_factor(n)
[79792266297612053, 79792266297612017]
}}}
A better check would be to first sort the liste returned (in case of two
prime factors).
Paul
--
Ticket URL: <http://trac.sagemath.org/ticket/16304#comment:1>
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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
