libtommath 1.2.0-6ok1 source package in openKylin
Changelog
libtommath (1.2.0-6ok1) yangtze; urgency=medium * Build for openkylin. -- rtlhq <nobelxyz@163.com> Tue, 13 Sep 2022 15:49:05 +0800
libtommath (1.2.0-6ok1) yangtze; urgency=medium * Build for openkylin. -- rtlhq <nobelxyz@163.com> Tue, 13 Sep 2022 15:49:05 +0800
Series | Published | Component | Section | |
---|---|---|---|---|
Yangtze V1.0 | release | main | libs | |
Yangtze V1.0 | proposed | main | libs |
File | Size | SHA-256 Checksum |
---|---|---|
libtommath_1.2.0.orig.tar.xz | 607.5 KiB | b7c75eecf680219484055fcedd686064409254ae44bc31a96c5032843c0e18b1 |
libtommath_1.2.0-6ok1.debian.tar.xz | 17.8 KiB | c7b2c1bec4cb1d1a0a869439eee6df2047994c270952a6b55dde55e83c96febb |
libtommath_1.2.0-6ok1.dsc | 2.0 KiB | 7630024a286403ac717c8499aa289b06569bff8015fb1fde6bf4c55e0de9fa06 |
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 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.
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.