Search Results for "large integer factorization" - Page 2

This library is being created as I have a need to do very fast FFTs on low end devices not supporting the NEON instruction set. The Raspberry Pi is an ideal candidate for developing in gcc before porting to JNI for low spec Android devices, hence it's inclusion. Fixed point 16/32 integer FFT library suitable for the Raspberry Pi and Android devices. Includes test stubs for gcc on the Raspberry Pi and a Basic4Android wrapper from JNI. It includes hand optimised ARMv6 assembler, demonstrating techniques such as pipeline stuffing to achieve maximum performance. It also demonstrates how to include large chunks of assembler inline with C/C++ thus avoiding ABI issues between platforms.

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.

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 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.

Sparse is a direct method solver for the large sparse matrices that are associated with electrical circuit simulation. It uses LU factorization and handles both real and complex square matrices.It is intended to solve many matrices with the same structure

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