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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
|
Source: fplll
Section: math
Priority: optional
Maintainer: Debian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
Uploaders: Tim Abbott <tabbott@mit.edu>,
Julien Puydt <julien.puydt@laposte.net>
Homepage: https://github.com/fplll/fplll/
Build-Depends: debhelper (>= 10), libmpfr-dev
Standards-Version: 3.9.8
Vcs-Git: https://anonscm.debian.org/git/debian-science/packages/fplll.git
Vcs-Browser: https://anonscm.debian.org/cgit/debian-science/packages/fplll.git
Package: libfplll2
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, libfplll2 (= ${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: libfplll2 (= ${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.
|
