| Key | Value |
|---|---|
| FileName | ./usr/lib/i386-linux-gnu/libtommath.la |
| FileSize | 962 |
| MD5 | 27812815BC732635CEF1BCE7874DDC71 |
| SHA-1 | CBCD5EE357EAC5217FB71F34730E8CB607C234B4 |
| SHA-256 | D5CF9DBCBFEDA8E712E129AD3D0859FF903704B99CE0BA2562A52B7AFBBC380E |
| SSDEEP | 12:D64fWgxGv/r5WFKeeLiP6BxIra+AAmBB7Szf77ixCFgz3RTZ/9IMCDwDqaAlH/Z:D5eSG9WciuxIu+Ahmfvi4I2N0De5/Z |
| TLSH | T1E7117B3A839D0639B9D00F96569F342ECA6E8438477B0A2C42CB9DCB1247C1631A6E77 |
| 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 | 65540 |
| MD5 | B9FB72BDFBFB3B9895E9C2A5E609FB44 |
| PackageDescription | 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. |
| PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
| PackageName | libtommath-dev |
| PackageSection | libdevel |
| PackageVersion | 1.2.0-3 |
| SHA-1 | D150B08876D24C5DFF468A7E02892217E6C23160 |
| SHA-256 | E13720415531B157233A7E8C7F8C830C28CAFA088D2CACF60B21E01CE8443DD7 |