Thank you all for your replies! 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... 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 If yes, I am willing to contribute. Spyros -- 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.