#5098: [with patch, with review, a little more work] Pollard rho algorithm for
generic discrete logarithm
-------------------------+--------------------------------------------------
Reporter: ylchapuy | Owner: tbd
Type: enhancement | Status: new
Priority: minor | Milestone: sage-3.3
Component: algebra | Resolution:
Keywords: |
-------------------------+--------------------------------------------------
Changes (by cremona):
* summary: [with patch, needs review] Pollard rho algorithm for generic
discrete logarithm => [with patch, with review,
a little more work] Pollard rho algorithm for
generic discrete logarithm
Comment:
I am having trouble applying the new patch. I have a 3.3.alpha2 build, so
#5088 is already merged. I apply trac-5098.patch ok. Then I apply
trac-5098-review.patch but get several hunks failing.
This might just be me being stupid, so it would be good if someone else
tried.
While I am here though, you did not quite understand my third point in the
original review: I did not mean that a new doctest should illustrate the
greater efficiency (or not) of the new algorithm, but it should at least
illustrate how to use the new parameter. e.g. take one of the existing
examples and compute it bothe ways and check that they are equal:
{{{
sage: F.<a>=GF(2^63)
sage: g=F.gen()
sage: u=g**123456789
sage: discrete_log(u,g,algorithm='bsgs') ==
discrete_log(u,g,algorithm='rho')
True
}}}
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/5098#comment:9>
Sage <http://sagemath.org/>
Sage - Open Source Mathematical Software: Building the Car Instead of
Reinventing the Wheel
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
