libtommath 1.2.1-ok1 source package in openKylin
Changelog
libtommath (1.2.1-ok1) nile; urgency=medium * New Upstream version 1.2.1. -- rtlhq <nobelxyz@163.com> Sat, 02 Sep 2023 18:10:25 +0800
libtommath (1.2.1-ok1) nile; urgency=medium * New Upstream version 1.2.1. -- rtlhq <nobelxyz@163.com> Sat, 02 Sep 2023 18:10:25 +0800
Series | Published | Component | Section | |
---|---|---|---|---|
Nile V2.0 | release | main | libs | |
Nile V2.0 | proposed | main | libs |
File | Size | SHA-256 Checksum |
---|---|---|
libtommath_1.2.1.orig.tar.xz | 188.9 KiB | 8d3e7b547e49764353e591ee6041a8dbe9f742032bb17351853024fbeefd036f |
libtommath_1.2.1-ok1.debian.tar.xz | 7.7 KiB | 3b5a59551cea0aa464468e42e4d9c05f78dd1a0a683819933ffed9a7e1e9dd53 |
libtommath_1.2.1-ok1.dsc | 1.9 KiB | d563318819df5c5f29d3382b4319f795fa201528cf545a16b20ecee855097e1c |
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.