| Key | Value |
|---|---|
| FileName | ./usr/share/doc/libtommath-docs/bn.pdf.gz |
| FileSize | 377115 |
| MD5 | C34C4F40E4741FADA5F7C32F82E1DCFD |
| SHA-1 | 98389C28340F28CAEBE6961D7E1934AEA8ECCCAD |
| SHA-256 | CFEBD01C498343D8D446192AB71279463FA7F871C24F838320AC158B8E688C10 |
| SSDEEP | 6144:X0FM6NGi2b/Wc4hUGupL4pyVUTVS4vYBSbpgNw4smZnVk2/epXB1OEkH8B70zYOV:GcmmGuaYUZS4vUSbpgsmJd/gx1GH8x0l |
| TLSH | T1C08423E76CF2A201FC543F7F16013A6F14945BB5D109562AE352334C03B16EBBA9A26F |
| 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 | 1691510 |
| MD5 | ED15559C6D0C1010ED70A56FB15BDD14 |
| 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 | 1.0-4 |
| SHA-1 | AF0AACD2D17A019FE5CADAFE5B11BA2B4C25551D |
| SHA-256 | 18DFDF87BA5DA1EB296D79C026C5178B9AD26CB8843FD7AB4D1CF6C4562BFC2C |