| Key | Value |
|---|---|
| FileName | ./usr/share/doc/libtommath-doc/bn.pdf.gz |
| FileSize | 423158 |
| MD5 | B73E05012149E0AD5E0547854CCF64ED |
| SHA-1 | 3BAB832F980F9A1468EEC844A9697E928FD4C542 |
| SHA-256 | 47931C98490980ACD261EA0365CF0639603C897FBEBA10E8AED7946D23E54D73 |
| SSDEEP | 12288:xjevtCLiIY4EPfIHFLNGQjFUt3/deFNBIKyC/NcmNsnpZ:xqvtCXLlRyl/dscKyCFz4pZ |
| TLSH | T15594238838B5E86DD70C69C36B92AF5BA4FC71537C31497AEF1072D5A69223F015313A |
| 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 | 429208 |
| MD5 | B6CB642557CEA1CE287CC8EAE56305DE |
| 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-3ubuntu0.1 |
| SHA-1 | 94787320CBA12C3E9CAB4F8A92AA3621B2B61414 |
| SHA-256 | 465B42408ED74398F7D80D1F24F2AE73D325D358DFE5D7597B23AFF46949CCE7 |