Bug#480081: RFP: fplll -- A library for LLL-reduction of euclidean lattices
Package: wnpp
Priority: wishlist
* Package name: fplll
* URL: http://perso.ens-lyon.fr/damien.stehle/english.html#software
* License: GPL
Programming Lang: C
* Description: A library for LLL-reduction of euclidean lattices
fpLLL contains different implementations of the floating-point LLL
reduction algorithm, offering different speed/guarantees ratios. It
contains a 'wrapper' choosing the estimated best sequence of variants
in order to provide a guaranteed output as fast as possible. In the
case of the wrapper, the succession of variants is oblivious to the
user.
.
From wikipedia: The Lenstra-Lenstra-Lovasz lattice basis reduction (LLL)
is a polynomial time lattice reduction algorithm. Given as input d
lattice basis vectors with n-dimensional integer coordinates and a
norm lesser than B, the LLL algorithm outputs an LLL-reduced
(short, nearly orthogonal) lattice basis in time
.
O(d^5 n log^3(B))
I have a draft packaging available in the apt repository described at
<http://wiki.sagemath.org/DebianSAGE> that I run for coordinating the
packaging of SAGE for Debian (#455292).
Since I don't have the time to maintain all 26 source packages I've
created as part of my effort to package SAGE's dependencies for Debian,
I'm looking for someone to adopt this package and maintain it in Debian.
I observe that this upstream package has a soname of 0.0.0; the maintainer
should probably contact the upstream developer and be sure they are doing
proper versioning. Otherwise, I think this package is ready.
-Tim Abbott
Reply to: