| Key | Value |
|---|---|
| FileName | ./usr/share/doc/libtommath-docs/bn.pdf.gz |
| FileSize | 377161 |
| MD5 | B6EF0AC1B18D4F771AB9ED010A6A045A |
| SHA-1 | 411836E0F30F965E9401D6128CDF6655BDD9B7A9 |
| SHA-256 | D6544806D3221E43C57F44D08346F0871F6EA11DD94E9CC38E3D98479C71A575 |
| SSDEEP | 6144:iPNXgHNqNnKzerab9Q/REHTflav9uaVU/5ZpWdYMGa9mXVAQwgm0nShnGmsily:iplNnK9b9Walav9v+9WdrGa9TdgahnG9 |
| TLSH | T1E98423C12175D24EBE5538FAE192FFDB25D2D922FC32186482B49263C4FB9D108BC993 |
| 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 | 1674872 |
| MD5 | 585D377DC101F2692CFF9124C929F282 |
| 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 | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
| PackageName | libtommath-docs |
| PackageSection | doc |
| PackageVersion | 1.0.1-1 |
| SHA-1 | E500C346E3476A317EB3106E8EAD4846B1DD923C |
| SHA-256 | 5ABE4C8F3CBD832D9F92CDF0922326AC21C9A8ACADDAB5800D5192D547F30D2F |