Search Results for "gmp"
Sort By:
Showing 41 open source projects for "gmp"
View related business solutions-
Build Data Resilience - Take the Assessment TodayIs your recovery strategy as strong as you think? Take this quick self-assessment to check your recovery readiness and gain tailored insights. In only 2 minutes, you'll learn where you fall on the recovery readiness scale.
-
Paessler: Easy to Use With Enterprise Power. Free TrialYou shouldn't have to choose between a monitoring tool that's easy to use and one that's powerful enough for a complex environment. PRTG's low-code interface lets any admin build dashboards, set alerts and monitor devices without scripting, while custom sensors and full API access are there when your team needs deeper control. One platform, no compromise. Download a free 30-day trial now.
-
1
phpseclib
PHP secure communications library
phpseclib is designed to be ultra-portable. The 3.0 version works on PHP 5.6+ and doesn't require any extensions. For purposes of speed, OpenSSL, GMP, libsodium or mcrypt are used, if they're available, but they are not required. phpseclib is designed to be fully interoperable with standardized cryptography libraries and protocols. MIT-licensed pure-PHP implementations of SSH-2, SFTP, X.509, an arbitrary-precision integer arithmetic library, Ed25519 / Ed449 / Curve25519 / Curve449, ECDSA / ECDH (with support for 66 curves), RSA (PKCS#1 v2.2 compliant), DSA / DH, DES / 3DES / RC4 / Rijndael / AES / Blowfish / Twofish / Salsa20 / ChaCha20, GCM / Poly1305. ... -
2
MadelineProto
Async PHP client/server API for the telegram MTProto protocol
...A Lua binding, a lua wrapper for td-cli scripts, Secret chats, MTProto 2.0, PFS, PFS in secret chats. MadelineProto can do everything official clients can do, and more! MadelineProto requires the mbstring, xml, json, fileinfo, gmp extensions to function properly. -
3
QFT fork-yzhs
testbed for QFT and such
This is a fork of Colin Benner's Frobenius benchmarking. https://github.com/yzhs/frobenius-test Quadratic Frobenius primality Test (QFT) as devised by Grantham has two relatively expensive first steps. In other projects, techniques were examined that may reduce that expense and are tested here. -
4
Optimus id transformation
Id obfuscation based on Knuth's multiplicative hashing method for PHP
...It is similar to Hashids but will generate integers instead of random strings. It is also super fast. If you will be running your code on a 32-bit system or will be working with large prime numbers it is suggested that you install the GMP extension. -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
5
bigz
Simple and complete bignum/rational C library with wrappers for C++
bigz is the continuation of an old BigNum project that started its life as a joined INRIA & Dec project in 1989. The current version includes many fixes and improvements. Although not as efficient as, say gmp, it is very small, reasonably efficient and extremely portable. -
6
GMP Fortran library
Fortran binding for GMP library
Fortran binding for GMP library. Currently gfortran compiler supported on Linux and MS Windows (MinGW) platforms. Included Fortran program for solving Archimedes's cattle problem. -
7
cohoperfect
cohomology computation using perfect forms
This is the software code of our manuscript "On the cohomology of the linear groups over imaginary quadratic fields". It produces the computation of the manuscript and creates the relevant tables. -
8
mpz_aprcl32
MPZ APRCL32 can prove the primality of numbers, written in C and GMP.
...This version incorporates improvements based on Jason Moxham's APR-CL code, which greatly reduced run-time memory requirements. mpz_aprcl is meant to be compiled on systems that support C, GMP, and a 64-bit data type. It can prove the primality of numbers up to 6021 digits long. mpz_aprcl32 is meant to be compiled on systems that support C, GMP, a 32-bit data type, but no 64-bit data type. This project can prove the primality of numbers up to 3827 digits long. Version 1.1 was posted on 2013/12/27. This new version is around 1.5-2.2x faster and has some bug fixes. ... -
9
mpz_aprcl
MPZ APRCL can prove the primality of numbers, written in C and GMP.
...This version incorporates improvements based on Jason Moxham's APR-CL code, which greatly reduced run-time memory requirements. mpz_aprcl is meant to be compiled on systems that support C, GMP, and a 64-bit data type. It can prove the primality of numbers up to 6021 digits long. mpz_aprcl32 is meant to be compiled on systems that support C, GMP, a 32-bit data type, but no 64-bit data type. This project can prove the primality of numbers up to 3827 digits long. Version 1.1 was posted on 2013/12/27. This new version is around 1.5-2.2x faster and has some bug fixes. ... -
AI-generated apps that pass security reviewRetool lets you generate dashboards, admin panels, and workflows directly on your data. Type something like “Build me a revenue dashboard on my Stripe data” and get a working app with security, permissions, and compliance built in from day one. Whether on our cloud or self-hosted, create the internal software your team needs without compromising enterprise standards or control.
-
10
TIDES
Taylor series Integrator for Differential Equations
Taylor series Integrator for Differential EquationS. This software is developed by Profs. A. Abad, R. Barrio, F. Blesa and M. Rodriguez, (GME, University of Zaragoza, Spain). It consists on a C (Fortran) library, libTIDES, and a Mathematica package, MathTIDES. (MathTIDES requires Mathematica version >= 7.0) . Basic references: * A. Abad, R. Barrio, F. Blesa, M. Rodriguez, 2012. Algorithm 924: TIDES, a Taylor series Integrator for Differential EquationS, ACM TOMS. 39, no. 1, art. 5.... -
11
resParser
Command line scientific calculator
resParser is a command line scientific calculator exploiting "50 digit precision" floating point computations using GMP and MPFR library. The project is open source with GLP v2 licence and cross platform. It is implemented with QT for GUI and for useful classes like QString. In the begin it was just a tool for computation of resistors values. Very similar to Speed Crunch as features Features: * Command line input * Built-in functions (log, exp, sin, cos, -
12
process-gmp
Simple Garmin NT to Garmin non-NT converter.
-
13
Extropy's DevPaks
A collection of the DevPaks for Dev-C++ that I maintain.
A collection of the DevPaks for Dev-C++ that I maintain: zlib libpng GMP MPFR wxWidgets GNU C Library Reference Cpp_manpages FANN Expat PCRE libtiff libjpeg JBIG-KIT CONIO libprimesieve liblzma_xz_utils OpenSSL -
14
FoxCalc
A pseudo-graphical calculator for FreeDOS (or any other DOS)
FoxCalc is a calculator with a text user interface (TUI), compiled for DOS. It supports a mouse, and uses the GMP library, therefore its results are highly accurate. FoxCalc is distributed as a zip FreeDOS package. That way, it can be easily installed using the FreeDOS package manager. -
15
MuPuPriNT
A primality/compositeness tester for different types of numbers.
MuPuPriNT (Multi-Purpose Prime Number Tester) is a primality and compositeness tester for many different types of numbers. It is basic, yet full-featured, and offers several different testing methods for each type of number. MuPuPriNT is built on the GNU Multiple-Precision (GMP) integer + rational library, and is available for Windows, OS X, and Linux. Source code is available as well, and can be built on any machine with Qt installed. As of version 2.0, MuPuPriNT is built on the cross-platform Qt application framework. There are currently two versions: MuPuPriNT and MuPuPriNT Extended. -
16
ICTC
a formula calculator base on gmp
ictc is a formula calculator, and it's also a high-precision calculator.I finished some normal math function like sin(x),cos(x),exp(x)...,and these functions have high convergence speed,so this tool(light weight) may be a good daily assistant for data reckoner. I holp this kid-tool will become more perfect and can do more special computing. -
17
GMP (MinGW)
Multiple Precision Arithmetic Library
A library for arbitrary precision arithmetic, operating on signed integers, rational numbers, and floating point numbers. -
18
-
19
Graphical Microcontroller Programming (GMP) is an expert-in-a-box solution which provides an intuitive user interface giving non-professionals the chance to easily create microcontroller programs by graphical means. Vienna University of Technology.
-
20
Multiprecision complex matrix and mathematics (using gmp and mpfr modules) and plotting (using OpenGL graphics). There are file I&O functions.
-
21
A library has been developed to simulate the round-off error of floating-point operations. While other existing similar libraries as GMP or MPFR are designed for infinite precision, this library is to simulate the round-off error propagation.
-
22
BSDMP is a cross-platform, highly-optimized multiprecision arithmetic library for manipulating large integers (BigInt) and very precise fractional values. It is intended to be a clean-room BSD-license replacement for the GMP (GNU Multiprecision Libra
-
23
-
24
MegaPi is a programm to calculate Pi. It uses the GMP-Lib for the long numbers. The maximum of Digits is just bounded to your Physical Memory. Available as source, and for GNU/Linux 32 + 64 Bit.
-
25
