| Key | Value |
|---|---|
| FileName | libtommath.so.1.0.0 |
| FileSize | 105256 |
| MD5 | 3AC1387112A6AF49321C13F0DB3A6B03 |
| RDS:package_id | 263765 |
| SHA-1 | 210C9391765A09CD8CAF25427BD117F44D33AD79 |
| SHA-256 | 9ACE55600E1B568793479050341C8F2BF1F70F4BE6131BDBFC71ED761E2D6FAD |
| SSDEEP | 1536:uQRKyeOCKjC7BbHSlRikkr6cNFVAtB5mQ5c7bGV2iaZp5h:uYeleFW5NctvrY |
| TLSH | T14BA33B47BAE224BDCAD58834035F532356F974D64112BB6F30886E713E17EA90F8DB62 |
| insert-timestamp | 1654978198.5252326 |
| source | modern.db |
| hashlookup:parent-total | 1 |
| hashlookup:trust | 55 |
The searched file hash is included in 1 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| FileSize | 56044 |
| MD5 | 6DF434CCA6623B1559881367ADA963CC |
| PackageDescription | 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. |
| PackageMaintainer | Joe Nahmias <jello@debian.org> |
| PackageName | libtommath1 |
| PackageSection | libs |
| PackageVersion | 1.0-4 |
| SHA-1 | 1048E7CB36375AC9E67DC5248C1FEBD6120F6289 |
| SHA-256 | 2F2E098B08E9C42382AAC5F885932469444230A8A37DC6A33A1B2596A28AA899 |