libtommath 1.2.0-2 source package in Ubuntu
Changelog
libtommath (1.2.0-2) unstable; urgency=medium * source only upload -- Dominique Dumont <email address hidden> Fri, 01 Nov 2019 10:02:45 +0100
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.0-2.dsc | 2.4 KiB | 40c75edc5d6bbf99b8f30b9dbba6ec43dfcd595eec716c00d5409998a18af3c4 |
| libtommath_1.2.0.orig.tar.xz | 607.5 KiB | b7c75eecf680219484055fcedd686064409254ae44bc31a96c5032843c0e18b1 |
| libtommath_1.2.0.orig.tar.xz.asc | 240 bytes | d90e7b82cbd5ced20e37cf96dea17a54878003f86021635d59245dde09bc0b74 |
| libtommath_1.2.0-2.debian.tar.xz | 19.1 KiB | 6c39d064ec734f9427090ec406fe079a7d41bc65e88e3b677e5867af7efdaab3 |
Available diffs
- diff from 1.2.0-1 to 1.2.0-2 (289 bytes)
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
