On Mar 23, 2007, at 09:09 , Michel wrote:
> Googling didn't reveal any open source implementations.
> The index calculus algorithm makes use of linear algebra
> over mod rings. Perhaps that is what makes it difficult to implement?
I may be off-base, but I think 'index calculus' is, or involves,
discrete logarithms. Google yields a trove of details about the
latter, including some code. See for example
<http://www.cs.toronto.edu/~cvs/dlog>
Justin
--
Justin C. Walker, Curmudgeon at Large
Institute for the Absorption of Federal Funds
-----------
If it weren't for carbon-14, I wouldn't date at all.
-----------
--~--~---------~--~----~------------~-------~--~----~
To post to this group, send email to sage-devel@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-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~----------~----~----~----~------~----~------~--~---
