Hi, On Thu, Aug 23, 2012 at 4:57 AM, spyros <spyrosthalki...@gmail.com> wrote: > I have seen that the following versions exist: > NTL-LLL, fp-LLL heuristic, fp-LLL fast, fp-LLL wrapper > > I still don't know to which algorithms the heuristic, fast and wrapper > packages > correspond to...
fplll is an external library that Sage includes. It might be useful to you to look up fplll's documentation: http://perso.ens-lyon.fr/xavier.pujol/fplll/ That, in particular, explains "heuristic", "fast" and "wrapper". > Would it be interesting to develop the following variants? > > 1) version with deep insertions (Schnorr and Euchner, Cohen) > 2) Pohst's algorithm > 3) Coppersmith's algorithm > 4) Fincke-Pohst algorithm with LLL preprocessing > 5) Kannan's algorithm > 6) Schnorr's algorithm You should feel free to work on whatever interests you :) My experience with fplll (used from Sage or directly from C) has been very positive; it seems very fast and stable. So I'd love to see the version of fplll in Sage upgraded to something more recent (e.g. 4.0.0), and more of the fplll functionality wrapped in. -- Best, Alex -- Alex Ghitza -- Lecturer in Mathematics -- The University of Melbourne http://aghitza.org -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To post to this group, send email to sage-devel@googlegroups.com. To unsubscribe from this group, send email to sage-devel+unsubscr...@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel?hl=en.
