#5098: [with patch, needs review] Pollard rho algorithm for generic discrete
logarithm
-------------------------+--------------------------------------------------
Reporter: ylchapuy | Owner: tbd
Type: enhancement | Status: new
Priority: minor | Milestone: sage-3.3
Component: algebra | Keywords:
-------------------------+--------------------------------------------------
First attempt to provide an algorithm using less memory than the "baby
step giant step" algorithm for generic discrete logarithm.
This algorithm uses only (small) constant memory. It is about 3 times
slower than bsgs on the examples I tested.
I also added an unused optional argument to bsgs to simplify the call in
discrete_log.
Proposed patch attached, with doctests.
(the attached patch needs #5088 to be applied first)
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/5098>
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
-~----------~----~----~----~------~----~------~--~---
