#13596: Improvements to IntegerMod is_square
-------------------------------------+-------------------------------------
Reporter: roed | Owner: AlexGhitza
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.12
Component: basic arithmetic | Resolution:
Keywords: | Merged in:
Authors: David Roe, Peter | Reviewers: Francis Clarke, Peter
Bruin | Bruin
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: #15193 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by jpflori):
Hi, I didn't have time to go through this ticket, but FYI I've
reimplemented the modular squareroot in cython using mpz's (translating
the original python/cython implem) at least when the mod is prime or 4
times a prime as part of an implementation of ECPP.
It's much faster than what we have and faster than PARI IIRC.
This should get published together with the rest of the ECPP implem when
the code is a little more polished, let's say before the end of the year
hopefully.
(We'll also present it in Paris at some Sage afternoon next week.)
--
Ticket URL: <http://trac.sagemath.org/ticket/13596#comment:18>
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/groups/opt_out.
