for CVP the only function is L.closest_vector(t) which uses Miccianchio-Voulgaris algorithm. Is there also another algorithm from fplll? thanks
On Tuesday, May 13, 2014 8:37:25 PM UTC+3, Martin Albrecht wrote: > > On Tuesday 13 May 2014 09:51:27 J.A. Ketch wrote: > > are the following algorithms implemented in sage? > > enum algorithm (for svp and cvp) > > fpLLL has enumeration for finding the shortest vector (the code for CVP is > experimental according to the docs). There's a ticket on trac implementing > an > interface > > http://trac.sagemath.org/ticket/15976 > > > miccianchio-voulgaris algorithm(for svp and cvp) > > The same ticket also contains code for CVP computation using Voronoi cell > computation (which was actually written ages ago, but never merged) > > > thank you > > Cheers, > Martin > > -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
