| Key | Value |
|---|---|
| FileName | ./usr/share/doc/libtommath-docs/tommath.pdf.gz |
| FileSize | 1048567 |
| MD5 | 732DAEAFC27B72E56D5B5437C4726F81 |
| SHA-1 | 02D8B5B96633CB73A3B09B437365A314AE80BADE |
| SHA-256 | FE645B9C27DEA262DEAA8891036AE130A58A7E7138622B39B4AE487583B95857 |
| SSDEEP | 24576:gN3xLOGwlxQc8bF2ZXvtgtPRmC3y9TWMpGTAI11j3NCh0hIYMOSghEkp:iiGw4c/ZFgZLgWAp21j3lWW |
| TLSH | T116253342C738B3A1ACACA6F29C53C6068EDD03B07D7F65BEE264C1195A2FE78453815D |
| 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 | 1448642 |
| MD5 | 251F3F831B615BE6FE27F6455DEE3950 |
| PackageDescription | 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 including the user manual and a book describing multiple-precision math. |
| PackageMaintainer | Joe Nahmias <jello@debian.org> |
| PackageName | libtommath-docs |
| PackageSection | doc |
| PackageVersion | 0.42.0-1.1 |
| SHA-1 | 0828A1D3237EB5C2F4ABDAAD416C7C1139F4DF6D |
| SHA-256 | 98A643273620BE496570BDF215DD5F1E86DF2B57EF233D5D4431045E607EF66E |