1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
|
Source: fplll
Section: math
Priority: optional
Maintainer: Tim Abbott <tabbott@mit.edu>
Homepage: http://perso.ens-lyon.fr/damien.stehle/english.html#software
Build-Depends: @cdbs@, libmpfr-dev, libgmp3-dev
Standards-Version: 3.8.0
Package: libfplll0
Architecture: any
Section: libs
Depends: ${shlibs:Depends}, ${misc:Depends}
Description: A library for LLL-reduction of Euclidean lattices, runtime
fpLLL is a library for computing nearly orthogonal basis 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 a shared library for libfplll.
Package: libfplll-dev
Architecture: any
Section: libdevel
Depends: ${shlibs:Depends}, ${misc:Depends}, libfplll0
Description: A 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.
|
