Key | Value |
---|---|
FileName | ./usr/lib/mips-linux-gnu/libtommath.a |
FileSize | 262600 |
MD5 | F3FF3498B7CE410296ACA2CBC24A6433 |
SHA-1 | 3E9EF59FC3E38B9DDA7ED3990C2E5ECAD4C26A49 |
SHA-256 | 07D6FC57715F540D61AAD7828D944AA124D2E7E201C97C71D02D449C9CD3B128 |
SSDEEP | 1536:UKyL27MoM3+0FTbpDpUyjisHng2kESEoGvfe6VztICvpkVpI8WhwL5/CB97LoVIt:xGFD5Dkio+26hwUuIn3WrcnnXRVFlGK |
TLSH | T10144A4591BA09DBDEC3CC17455F787283778D8A869C68717324CF0682F429887F6BE98 |
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 | 67194 |
MD5 | 596258EC65E2904FB6F0CE47A92DDD59 |
PackageDescription | multiple-precision integer library [development files] 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 files needed to create programs that use LibTomMath. It is not needed to merely execute programs that use LibTomMath. |
PackageMaintainer | Joe Nahmias <jello@debian.org> |
PackageName | libtommath-dev |
PackageSection | libdevel |
PackageVersion | 1.0-4 |
SHA-1 | 68E0A3401B948CE2A4285B7E50DFD099FFD9D567 |
SHA-256 | C9AC3E1B4546D59C50F218C5E09FA53221C3F9358E47A12676F6A7C7C4F66FFF |