Source: fplll
Section: math
Priority: optional
Maintainer: Debian Science Maintainers
Uploaders: Tim Abbott ,
Julien Puydt ,
Ximin Luo
Homepage: https://github.com/fplll/fplll/
Build-Depends: debhelper (>= 11), libmpfr-dev
Standards-Version: 4.1.4
Vcs-Git: https://salsa.debian.org/science-team/fplll.git
Vcs-Browser: https://salsa.debian.org/cgit/science-team/fplll
Package: libfplll5
Architecture: any
Multi-Arch: same
Section: libs
Pre-Depends: ${misc:Pre-Depends}
Depends: ${shlibs:Depends}, ${misc:Depends}
Description: Library for LLL-reduction of Euclidean lattices, runtime
fpLLL is a library for computing reduced (nearly orthogonal) bases
for Euclidean lattices using the LLL algorithm.
.
fpLLL contains multiple different implementations of the
floating-point LLL reduction algorithm, offering multiple different
speed/guarantees ratios.
.
It contains a 'wrapper' that chooses 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.
.
This package contains the shared library libfplll.
Package: libfplll-dev
Architecture: any
Multi-Arch: same
Section: libdevel
Depends: ${misc:Depends}, libgmp-dev, libmpfr-dev, libfplll5 (= ${binary:Version})
Description: Library for LLL-reduction of Euclidean lattices, development
fpLLL is a library for computing reduced (nearly orthogonal) bases
for Euclidean lattices using the floating-point LLL algorithm.
.
fpLLL contains multiple different implementations of the
floating-point LLL reduction algorithm, offering multiple different
speed/guarantees ratios.
.
It contains a 'wrapper' that chooses 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.
.
This package contains development files for libfplll.
Package: fplll-tools
Architecture: any
Depends: libfplll5 (= ${binary:Version}), ${shlibs:Depends}, ${misc:Depends}
Description: Tools to compute LLL-reduction of Euclidian lattices
fpLLL is a library for computing reduced (nearly orthogonal) bases
for Euclidean lattices using the floating-point LLL algorithm.
.
fpLLL contains multiple different implementations of the
floating-point LLL reduction algorithm, offering multiple different
speed/guarantees ratios.
.
It contains a 'wrapper' that chooses 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.
.
This package contains the base tools using libfplll.