| Key | Value |
|---|---|
| FileName | ./usr/share/doc/libtommath-doc/bn.pdf.gz |
| FileSize | 423502 |
| MD5 | A1C864B796B72DB268E97C4D6869765F |
| SHA-1 | 1280EDA334A0B24D85A67D195DE37861D6B136E3 |
| SHA-256 | EA2D1ABEDEE51081705548F518C3A4D9F4792A2298458F3153D502DB94CE854F |
| SSDEEP | 6144:w3jbIjmgk9hzpTdQRJkeRRBhO7zu+Ikv/liNaHxRyj1y3+yIZ/FR3+P96pXpdghP:wTUaHxT+BbY7qRW/W4ew3+yitkQpd5e |
| TLSH | T15E94233C6EC03A2D780466DC0EE4E71F7A8D50697BAAF06157553C0E45B117338FAADA |
| 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 | 429476 |
| MD5 | 9C08C9149769670B5F6FC9D08C9ABCE6 |
| 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. |
| PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
| PackageName | libtommath-doc |
| PackageSection | doc |
| PackageVersion | 1.2.0-6build1 |
| SHA-1 | 1C49F3DD36FE983EA0C552F0763EA204620FDEE1 |
| SHA-256 | EE41DE8A2804F90542FB15E686F5ADC4B6B547F8C11E08F67EA17BE9879FC5F6 |