I want to know how SAGE finds the discrete logarithm problem in finite fields and in EC groups. Is it in the same way? (and then which algorithm is implemented?) Or do SAGE apply faster methods in finite fields?
The rationale for asking is that I would hope SAGE used a faster method when in a finite field s.t. I could observe the speedup when doing a MOV reduction on a Dlog problem in an EC group. /David --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
