Key | Value |
---|---|
FileName | ./usr/share/doc/libtommath-docs/bn.pdf.gz |
FileSize | 372037 |
MD5 | EFB1A4BF737C080DE6423836EC42FF0C |
SHA-1 | 246FD7735AE6E33649405A8AB8ED8E4D93F2AEEC |
SHA-256 | 6072EFCBC9F28B3E7B384E1BF9C20ED4E2B6F262E14BD6599EE9F4C1065E08EC |
SSDEEP | 6144:5Bw9ghgdD0ZcGkfCqNCcZbkG7ZEwGaawXS8MlYJ3oiMwU0Djw384wpMuoun0PvzX:rgI/ZcGkflCcZtSQVi1lUY8LDjwOLZ0j |
TLSH | T1DE842356D3F95B1C26ACFE8D0643EBC30A0B8BBE2C1CBA586F4821DBF5106927457947 |
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 |