Search Results for "large integer factorization" - Page 2

KeplerDB is a temporal database to store time/value entries where the type of value could be integer, float/double, boolean and string. KeplerDB is dedicated to be scalable and to create clusters of server allowing the user to analyse and store massing amount of data to monitor systems like computers, clusters, building and captors or financial systems like markets and accounts. The user can use KeplerDB to make data analysis on enormous amount of data (statistics and modelling).

Helps to program ( in C++) simulations or long-running calculations with many iterations. Easily write C++ code that is same as single-threaded ( or shorter and simpler) , and gxLibrary will compile and run that code as massive multi-threaded on any available GPU (CUDA/AMP) or CPU, either on local or remote PC. Write code functions once, just like they would be written for regular single-threaded cases - no need to write separate code for CUDA or AMP or CPU, or to modify code for...

Linear Program Solver (LiPS) is an optimization package oriented on solving linear, integer and goal programming problems. The main features of LiPS are: ● LiPS is based on the efficient implementation of the modified simplex method that solves large scale problems. ● LiPS provides not just an answer, but a detailed solution process as a sequence of simplex tables, so you can use it for studying/teaching linear programming

This project is no longer supported. Use it on your own risk (or not use at all). Microhex is an intuitive HEX editing application that enables you to view and manipulate binary data for any file in your computer. Microhex displays the integer column and the characters column, allowing you to add new columns and delete existing ones. Each column can be assigned an unlimited number of linked address bars.

The application calculates the factorization of integer numbers. Part of the Tibi's Mathematics Suite. Requirements: .NET Framework 4.0

Large Integer Calculator. Includes most arithmetic functions plus named memory values.

LameUtils contails LameInts (large integer numbers signed and unsigned), LameStrings, and LameArray.

C++ large integer class with Boost License.

Many computational problems need arithmetic operations in polynomial finite rings over Z/nZ, where n is an integer (n>1). This library provides efficient operations for applications such as integer factorization and primality testing.

primedb is a project that attempt to generation prime numbers fast and saving them to a database(Mysql or else) for prime research: finding large number of prime,prime factorization,Goldbach's conjecture,twin prime conjecture...

MpNT is a multi-precision number theory library that provides a base for building cryptographic applications. It may however be used in any domain where efficient integer, modular, and floating-point computations involving large numbers are required.

This is a collection of vb class modules written in native Visual Basic. They provide the following functionality: Processing of very large integer numbers, hashing algorithms, prime number handling and an implementation of the RSA algorithm.

This is a library of classes and functions to be used to abstract arbitrarily large integer and floating-point numbers in C++. All standard operators are overloaded so the user is able to substitute "mpi" for "int" and "mpf" for "double" to use.

Myfu is a merge of the YAFU and Msieve libraries for integer factorization