On 3/23/07, Michel <[EMAIL PROTECTED]> wrote: > > Hmm too bad. > > 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 suspect the issue is more that people who implement this algorithm are cryptographers (cryptanalysis), and they usually work like this: (1) implement algorithm (2) optimize until they can solve some new, as yet uncracked dl challenge problem (3) announce (2) -- you can find this regularly on the number theory mailing list that Victor Miller moderates (4) realize that they are the best publicly announced system in the world, and want to stay that way, hence they don't release code. Similarly, there doesn't seem to be a good freely available implementation of the general number field sieve for integer factorization (though there are two quadratic sieve implementations available -- one in SAGE by Bill Hart). Regarding sparse linear algebra mod-p, yes, it's nontrivial. We do have it in SAGE now, though it could probably be greatly improved. Anyway -- if anybody who really knows what they are talking about could comment on what I wrote above (e.g., set me straight), please don't hesitate. William --~--~---------~--~----~------------~-------~--~----~ 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/ -~----------~----~----~----~------~----~------~--~---
