Euler Math Toolbox
Welcome to the download page for Euler Math Toolbox, a powerful software developed by the brilliant ... exceptional toolbox equips you with an array of mathematical tools and functions to explore and conquer complex ...
Msieve 1.53
Large-integer factoring with SIQS and GNFSMsieve is an open-source C library and factoring program for finding the prime factors of large integers. It implements SIQS for general-purpose factoring and GNFS for especially large composites. The software handles stages including relation collection, filtering and linear algebra, and can be used directly or incorporated into other mathematical software. Factoring time and resource use depend on the input.
Msieve 1.53 details
| Author: | jasonp_sf |
| License: | Open Source |
| Price: | FREE |
| Released: | Nov 11, 2016 |
| File size: | 1.20 MB |
| Downloads: | 260 |
| Keywords: | Msieve software, x64 architecture, GNFS algorithm, math, implement, Sourceforge project, implement algorithm, c factoring library, mathematical, number theory library, gnfs factoring, siqs factoring, open-source factoring, integer factorization software, large number factoring, marthematical library, Windows 10 compatibility, jasonp_sf developer |
| Author URL: | http://sourceforge.net/projects/msieve/ |
Msieve Awards
Msieve for Windows 10 - Full description
Msieve is an open-source C library and factoring program for finding the prime factors of large integers. It is intended for mathematicians, researchers and developers working with number theory or integer factorization, rather than for general-purpose calculations. Its central purpose is to apply specialized factoring algorithms to integers that are too large for straightforward trial division to handle efficiently.
The software implements the Self-Initializing Quadratic Sieve (SIQS), a general-purpose method for factoring composite integers, and the General Number Field Sieve (GNFS), a method used for particularly large composites. These algorithms search for relationships that can be combined to reveal a nontrivial divisor. The choice of method depends on the size and structure of the number being factored; the GNFS is especially suited to large numbers that are not covered by simpler, more specialized approaches.
Msieve brings together the stages needed to carry out these algorithms, including selecting polynomials and collecting relations for the number field sieve. It also supports the filtering and linear algebra steps used to process those relations and identify factors. These stages can involve substantial computation, so factoring time and resource use depend heavily on the input integer and the machine doing the work. Msieve can be used as a ready-to-run factoring tool or incorporated as a C library in other software that needs integer-factorization functionality.
Typical uses include experimenting with factoring methods, studying the computational stages of SIQS and GNFS, and factoring large composites in mathematical or research projects. Developers can use the library as a basis for programs that perform number-theoretic computations, while command-line use provides a direct way to submit integers for factorization. The program focuses on factoring; it is not a general symbolic algebra package or a broad collection of everyday math tools.
Msieve is open source and is distributed for Windows, with support listed for Windows versions through Windows 10. Its C implementation makes it suited to technical users comfortable with mathematical software and its computational demands. Factoring is not guaranteed to finish quickly: the difficulty rises sharply with the size of the input, and large jobs can require considerable processing time and memory.