| Key | Value |
|---|---|
| CRC32 | 33DB0691 |
| FileName | ./usr/share/doc/libtommath0/copyright |
| FileSize | 527 |
| MD5 | 98BC0CB525CB6DC43F4375836DB2F87C |
| OpSystemCode | {'MfgCode': '1006', 'OpSystemCode': '362', 'OpSystemName': 'TBD', 'OpSystemVersion': 'none'} |
| ProductCode | {'ApplicationType': 'Operating System', 'Language': 'English', 'MfgCode': '87641', 'OpSystemCode': '599', 'ProductCode': '163706', 'ProductName': 'Maui Linux', 'ProductVersion': '17.03'} |
| RDS:package_id | 222721 |
| SHA-1 | 9AF998831D129A96291A6387170E5962CF673D27 |
| SHA-256 | F37506A9511A1DFED6081C3F15872F963FDE682F1279E24C195C75663C093E7D |
| SSDEEP | 12:hVg/Br4K7QWIKBK5KBLQwdrtaQaivhVrbPmL1S:0Br4ekG6Fert86bu8 |
| SpecialCode | |
| TLSH | T1FDF0C9BD4D1D03A8F1A09B53B8C9DCCB828B360702AAE39A30448BDE8F20000F45634A |
| db | nsrl_modern_rds |
| insert-timestamp | 1727040695.5530353 |
| source | RDS.db |
| hashlookup:parent-total | 19 |
| hashlookup:trust | 100 |
The searched file hash is included in 19 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 |
| Key | Value |
|---|---|
| FileSize | 41270 |
| MD5 | BB89DBDAAFADE68B6EE004FADF6780D3 |
| PackageDescription | multiple-precision integer library [runtime] 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 library itself which is need to run programs that use LibTomMath. |
| PackageMaintainer | Joe Nahmias <jello@debian.org> |
| PackageName | libtommath0 |
| PackageSection | libs |
| PackageVersion | 0.42.0-1.1 |
| SHA-1 | 1581CFDE6354E11F4F3A1099DD962D052F074871 |
| SHA-256 | B50EE9F4EDE4F09DE8EF3328FB1A93BF57A0AF2DAD143E3FF2DC50841D264EFD |
| Key | Value |
|---|---|
| FileSize | 64490 |
| MD5 | 5A4D2C5DE711AB30FE051C9584B55173 |
| 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 | 0.42.0-1.1 |
| SHA-1 | 1E63CA224A4EA22A57A7260FFA1009AED6CB2257 |
| SHA-256 | DE01A135AEBEF04047E040DFBAC4F470C062D540D04EC84A3D649AF51EE994EF |
| Key | Value |
|---|---|
| FileSize | 1447022 |
| MD5 | 3DE33DD8AEBBF5378059273CF641FF17 |
| 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 | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
| PackageName | libtommath-docs |
| PackageSection | doc |
| PackageVersion | 0.42.0-1.2 |
| SHA-1 | 218A4EB9F10A96EE50926E1C13CE5859B9A5D2EE |
| SHA-256 | 18B0DBBDD844521B6BA0F950E76304B7855D364C984ACAE1BDB85BCA2E85861B |
| Key | Value |
|---|---|
| FileSize | 60728 |
| MD5 | B847AF0376CB4D486F8E135DCD5CA233 |
| 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 | 0.42.0-1.1 |
| SHA-1 | 2F67273C91C71F8DE8F965B29480FAF89065F4A9 |
| SHA-256 | 55855D3771CFB341FF7BB363A58E2511DD1C2F724BBBC433AFB06CC5DB87F843 |
| Key | Value |
|---|---|
| FileSize | 41826 |
| MD5 | 279CEBBB3A2CE1C666A1EFD70F836C2D |
| PackageDescription | multiple-precision integer library [runtime] 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 library needed to run programs that use LibTomMath. |
| PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
| PackageName | libtommath0 |
| PackageSection | libs |
| PackageVersion | 0.42.0-1.2 |
| SHA-1 | 3A5549AB101826EB52EC9D9DD8597BD084E82A5F |
| SHA-256 | 56CEF23B45DD776711963B218A15F23AA070F703C31F676704B142FE0FE0C7FD |
| Key | Value |
|---|---|
| FileSize | 1437510 |
| MD5 | 97CB27CD96BC5F20AA392274B1AFE023 |
| 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 | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
| PackageName | libtommath-docs |
| PackageSection | doc |
| PackageVersion | 0.42.0-1build1 |
| SHA-1 | 45A92A4E8A62B97ECED6FA774658C19F818FDD61 |
| SHA-256 | C5BB96D171AB371AF9AA79DCDC43615051195C66326AA41BE15382A28F5B309D |
| Key | Value |
|---|---|
| FileSize | 52920 |
| MD5 | FA06B6185EAC1101D72E222EB6BC99FA |
| 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 | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
| PackageName | libtommath-dev |
| PackageSection | libdevel |
| PackageVersion | 0.42.0-1.2 |
| SHA-1 | 472DA8B31778068CB987950A81F9B7AA953C4EB5 |
| SHA-256 | 996FD117439B2EE1C36C9D835D7CE7E54B5568533C472AC52F80111004B0741D |
| Key | Value |
|---|---|
| FileSize | 39770 |
| MD5 | 30362653469EF0750CAF3B2525EEEB22 |
| PackageDescription | multiple-precision integer library [runtime] 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 library needed to run programs that use LibTomMath. |
| PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
| PackageName | libtommath0 |
| PackageSection | libs |
| PackageVersion | 0.42.0-1.2 |
| SHA-1 | 4948E2DBBF947ECFFC10519C5B1CE937EE81E1A2 |
| SHA-256 | DFC9D6633959452CE77E0FCD0A29DE0585B115DE59A9E9AF36BB215542C78471 |
| Key | Value |
|---|---|
| FileSize | 53886 |
| MD5 | 32254B15D9D5BE452C17542885678621 |
| 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 | 0.42.0-1.1 |
| SHA-1 | 57B0A082E6AABA93E95657F7AAC3C56913C4D8D3 |
| SHA-256 | 4103E29455DD3E162A33CA9FACC7FAE9567828E65612FAD5DF15C4A4CDF92590 |