Key | Value |
---|---|
FileName | ./usr/share/doc/libtommath-doc/bn.pdf.gz |
FileSize | 423042 |
MD5 | FA5BD5F6F7D1298EAF5DEE87E72CE17B |
SHA-1 | 5CFF27E0116428A0830ED971C01C3F01904BAC3E |
SHA-256 | AEA367CDE897DC48BD80CFF998978EC8C4675DB99344D84896962CA149287C3E |
SSDEEP | 6144:OTJh92ulo2msyVWIZhO7zu+ItRUUTyfNuKVFPKOXrs8GzTcWii5uuhq0lq:Gh8ua2msWWIZY7qRwsgVFPKOY8GnZZqJ |
TLSH | T16C9423E43F67AE621486729E28A49C8C3D73E3A739C09474A7E651ACC7ED01E517CD32 |
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 | 429008 |
MD5 | B1451A60904031710DBF1A6206359DCA |
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-5 |
SHA-1 | 6478F8EE9D8E158ED0FFFB0E7A777FA57BC2A811 |
SHA-256 | 40F978C8E3A0B735117B4B1B14838879BC91BDCCF23FDD5F3FD4D5D8510293CB |