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