openKylin libtommath package

libtommath 1.2.0-ok1 source package in openKylin

Changelog

libtommath (1.2.0-ok1) yangtze; urgency=medium

  * Build for openKylin.

 -- openKylinBot <email address hidden>  Mon, 25 Apr 2022 22:03:04 +0800

Upload details

Uploaded by:
openKylinBot
Sponsored by:
luzp
Uploaded to:
Yangtze V1.0
Original maintainer:
Openkylin Developers
Architectures:
any all
Section:
libs
Urgency:
Medium Urgency

Publishing See full publishing history

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
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-ok1.debian.tar.xz 17.0 KiB 82f0ff2fe551946699e6bf4683dd9c90adf506841b78280f0b18ced82192adc7
libtommath_1.2.0-ok1.dsc 2.2 KiB c84f391cabd307b3e3a136670234d9e1d19b2a2d613293005210ec4d147f26f2

View changes file

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.