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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
|
Source: libtommath
Maintainer: Debian Rakudo Maintainers <pkg-rakudo-devel@lists.alioth.debian.org>
Uploaders: Dominique Dumont <dod@debian.org>
Section: libs
Priority: optional
Build-Depends: autoconf,
debhelper-compat (= 12),
libtool
Build-Depends-Indep: ghostscript,
libtiff-tools,
texlive-latex-extra,
texlive-latex-recommended
Standards-Version: 4.5.1
Vcs-Browser: https://salsa.debian.org/debian/libtommath
Vcs-Git: https://salsa.debian.org/debian/libtommath.git
Homepage: http://www.libtom.net/LibTomMath/
Package: libtommath-doc
Architecture: all
Multi-Arch: foreign
Section: doc
Depends: ${misc:Depends}
Conflicts: libtommath-docs
Replaces: libtommath-docs
Description: multiple-precision integer library [documentation]
LibTomMath is a C language library that provides a vast array of highly
optimized functions for number theory; including:
.
* Simple Algebra (Addition, Subtraction, Multiplication, Division)
* Digit Manipulation (shift, binary AND/OR/XOR)
* Modular Reduction (Barrett, Montgomery, DR, 2k)
* Number Theory
- Greatest Common Divisor
- Least Common Multiple
- Jacobi Symbol Computation
- Multiplicative Inverse
- Modular Exponentiation
- Fermat & Miller-Rabin Primality Tests
* Miscellaneous
- Root finding over Z
- Pseudo-random integers
- Signed & Unsigned comparisons
- Karatsuba and Toom-Cook multiplication algorithms
- Fast Comba based Multiplier, Squaring and Montgomery routines
.
This package contains the documentation for the LibTomMath library.
Package: libtommath-dev
Architecture: any
Multi-Arch: same
Section: libdevel
Depends: ${misc:Depends},
libtommath1 (= ${binary:Version})
Recommends: libtommath-doc
Description: multiple-precision integer library [development files]
LibTomMath is a C language library that provides a vast array of highly
optimized functions for number theory; including:
.
* Simple Algebra (Addition, Subtraction, Multiplication, Division)
* Digit Manipulation (shift, binary AND/OR/XOR)
* Modular Reduction (Barrett, Montgomery, DR, 2k)
* Number Theory
- Greatest Common Divisor
- Least Common Multiple
- Jacobi Symbol Computation
- Multiplicative Inverse
- Modular Exponentiation
- Fermat & Miller-Rabin Primality Tests
* Miscellaneous
- Root finding over Z
- Pseudo-random integers
- Signed & Unsigned comparisons
- Karatsuba and Toom-Cook multiplication algorithms
- Fast Comba based Multiplier, Squaring and Montgomery routines
.
This package contains the files needed to create programs that use LibTomMath.
It is not needed to merely execute programs that use LibTomMath.
Package: libtommath1
Architecture: any
Multi-Arch: same
Depends: ${misc:Depends},
${shlibs:Depends}
Description: multiple-precision integer library [runtime]
LibTomMath is a C language library that provides a vast array of highly
optimized functions for number theory; including:
.
* Simple Algebra (Addition, Subtraction, Multiplication, Division)
* Digit Manipulation (shift, binary AND/OR/XOR)
* Modular Reduction (Barrett, Montgomery, DR, 2k)
* Number Theory
- Greatest Common Divisor
- Least Common Multiple
- Jacobi Symbol Computation
- Multiplicative Inverse
- Modular Exponentiation
- Fermat & Miller-Rabin Primality Tests
* Miscellaneous
- Root finding over Z
- Pseudo-random integers
- Signed & Unsigned comparisons
- Karatsuba and Toom-Cook multiplication algorithms
- Fast Comba based Multiplier, Squaring and Montgomery routines
.
This package contains the library needed to run programs that
use LibTomMath.
|
