libtommath 1.2.1-2 source package in Ubuntu
Changelog
libtommath (1.2.1-2) unstable; urgency=medium * cleanup generated files (Closes: #1052168) * control: use debhelper 13 * control: declare compliance with policy 4.6.2 * control: remove obsolete conflict/replace * control: set Rules-Requires-Root to no -- Dominique Dumont <email address hidden> Fri, 20 Oct 2023 17:06:20 +0200
Upload details
- Uploaded by:
- Debian Rakudo Maintainers
- Uploaded to:
- Sid
- Original maintainer:
- Debian Rakudo Maintainers
- Architectures:
- any all
- Section:
- libs
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section |
---|
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
libtommath_1.2.1-2.dsc | 2.2 KiB | 39a0aa4035b6be52cd2838d1b46f7108c3af7f782db2792f2f362b6141e61106 |
libtommath_1.2.1.orig.tar.gz | 236.7 KiB | 068adaf5155d28d4ac976eb95ea0df1ecb362f20d777287154c22a24fdb35faa |
libtommath_1.2.1-2.debian.tar.xz | 20.0 KiB | aecec899f6243dfbf2c9583790315cdd11ee7dfcfb35b0288c049363b0f181bd |
Available diffs
No changes file available.
Binary packages built by this source
- libtommath-dev: 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.
- libtommath-doc: 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.
- libtommath1: 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.
- libtommath1-dbgsym: debug symbols for libtommath1