## Factoring Code## Elliptic Curve method- free ECM implementation from ECMNET (http://www.loria.fr/~zimmerma/records/ecmnet.html).
- Dario Alpern's Java ECM implementation.
## Quadratic Sieve- Implementatations for speed comparisons of MPQS vs SIQS. Remark: code is not very portable, and you may need to make adjustments to get it to work on your computer (see comments in code). Requires Arjen Lenstra's LIP package.
- An implementation of PPSIQS from http://www.asahi-net.or.jp/~KC2H-MSM/cn/.
- Dario Alpern's Java SIQS implementation.
- Jens Franke's MPQS for Linux from ftp://ftp.math.uni-bonn.de/people/franke/mpqs4linux/.
## Number Field Sieve- Sample implementation of the Number Field Sieve which runs on the Magma computer algebra system. This is intended as a learning tool rather than an optimized implementation.
- Sample implementation of algorithm 12.1 in the paper "Factoring Integers with the Number Field Sieve" by J.P. Buhler, H.W. Lenstra, Jr, and Carl Pomerance which runs on the Magma computer algebra system. This is intended as a learning tool rather than an optimized implementation. Note that this code is a more general implementation of the NFS than the code in the previous bullet.
- Sample Magma code for Murphy's non-skewed polynomial selection method. This code doesn't perfectly match Murphy's algorithm, so please feel free to suggest modifications/improvements.
- Chris Card's GNFS implementation, available under gnu public license.
other sites that have factoring code include Jeffrey Hamblin's integer factorization project web site and Paul Herman's factoring page. Return to the FactorWorld main page. |