Key | Value |
---|---|
FileName | ./usr/share/doc/libtommath-docs/tommath.pdf.gz |
FileSize | 1210104 |
MD5 | 9AA06D796CC8D06FE6CFF86FFF1FFA59 |
SHA-1 | F5F14DE3748AC77B40EF60B672F0909A73C06582 |
SHA-256 | C9D7A1D83FAB8940FDB8095DD1453B476B4C9A023297376B6792DBD5D1F22BDA |
SSDEEP | 24576:NTWI9l9J62ymUfVk3ScDnH7IMkIwycDNS9yQ4NrvtW1l8mXTMAjH:F7lj622kCcDnH7I6NmNS8tBW1l8mtH |
TLSH | T1E64533E4600CA41B1B5250E9CBE2A74DD3E96F0B42D48B3BC7B3ABC9D9ED52741434D6 |
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 |