the fpLLL docs state that CVP support is experimental and shouldn't be used yet. If your CVP instance is BDD (i.e. you know a bound) you could reduce it to uSVP e.g. like this: http://eprint.iacr.org/2013/602.pdf
On Monday 26 May 2014 12:45:55 J.A. Ketch wrote: > 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
signature.asc
Description: This is a digitally signed message part.
