Ubuntu
libtommath package

libtommath 1.2.0-6ubuntu0.22.04.1 source package in Ubuntu

Changelog

libtommath (1.2.0-6ubuntu0.22.04.1) jammy-security; urgency=medium

  * SECURITY UPDATE: Integer Overflow
    - debian/patches/CVE-2023-36328.patch: fix possible integer
      overflow in multiple bn_* files.
    - CVE-2023-36328

 -- Leonidas Da Silva Barbosa <email address hidden>  Tue, 12 Sep 2023 09:52:27 -0300

Upload details

Uploaded by:
Leonidas S. Barbosa
Uploaded to:
Jammy
Original maintainer:
Ubuntu Developers
Architectures:
any all
Section:
libs
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Jammy updates main libs
Jammy security main libs

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-6ubuntu0.22.04.1.debian.tar.xz 21.2 KiB d816ba994fab89d5e0c7b66745ed4a491dfc79d37fdff29032f4bada5be1f5b4
libtommath_1.2.0-6ubuntu0.22.04.1.dsc 2.6 KiB cfefc52dc51d03df7c4b76db9383d8e909562e0f5057033f7513a74e76c93cfe

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.

libtommath1-dbgsym: debug symbols for libtommath1