ZhengLinLei / gnfs.cpp

General Number Field Sieve GNFS – sometimes just called the Number Field Sieve is a factorization algorithm for numbers over about 115 (decimal) digits

The General Number Field Sieve [WIP]

This project implements the general number field sieve, the asymptotically-fastest algorithm for factoring large integers.

The algorithm is as described in Algebraic Number Theory by Jarvis, Prime Numbers: A Computational Perspective by Crandall and Pomerance, and others.

Building

This project depends on Victor Shoup's NTL NTL - Github and CMake, and is written in C++11. Build as follows:

mkdir build
cd build
cmake ..
make -j8

===============================

How to install NTL? Manual

gunzip ntl-xxx.tar.gz
tar xf ntl-xxx.tar
cd ntl-xxx/src
./configure 
make
make check
sudo make install