On 9/21/07, David Kohel <[EMAIL PROTECTED]> wrote: > Since LLL and LLLGram in Magma V2.13 are written by Damien Stehle, > using his asymptotically better algorithm. The previous version was > not > even mathematically correct (adhoc "improvements" or post-processing > could destroy the LLL reduction condition). > > Damien provides C code under GPL and can be found on his web page: > > http://perso.ens-lyon.fr/damien.stehle/english.html > > It might take some art to decide on optimal parameters, but linking it > into > SAGE should provide the same asymptotic performance as in Magma.
David, many thanks for pointing this out!! It's extremely interesting. I hope somebody (e.g., Martin?) can build Damien's code and do some benchmarks very soon. -- 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/ -~----------~----~----~----~------~----~------~--~---
