, Martin Albrecht wrote:
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
are the following algorithms implemented in sage?
enum algorithm (for svp and cvp)
miccianchio-voulgaris algorithm(for svp and cvp)
thank you
--
You received this message because you are subscribed to the Google Groups
sage-support group.
To unsubscribe from this group and stop receiving emails
I install sage in ubuntu using the following commands:
$apt-add-repository -y ppa:aims/sagemath
$apt-get update
$apt-get install sagemath-upstream-binary
I run sage and gave
sage: hg_sage.status()
NameError Traceback (most recent call last)
thank you all for the answers
the version of my sage is : Sage Version 6.1.1, Release Date: 2014-02-04,
so I can not use hg. Some sites for the development refers to hg and not to
git. For instance
http://combinat.sagemath.org/doc/thematic_tutorials/tutorial-how-to-contribute.html,
but is old.
