#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 | Resolution:
Keywords: |
-------------------------+--------------------------------------------------
Comment (by cremona):
Replying to [comment:2 ylchapuy]:
> I don't really know what makes it slow. I suspect the use of "hash" is
costly but I see no other way to partition generically a group in
approximately equal size chunks.
That is probably right. It might be worth putting in a comment (or a
docstring sentence aimed at future developers) saying that the efficiency
of the functions depends on having a fast hash.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/5098#comment:3>
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
-~----------~----~----~----~------~----~------~--~---
