Number Field Sieve

This web presents 2010/2015 implementation of the number field sieve (NFS). This program is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation. The development was supported by project VF20102015006.

The implementation has the following properties:

• base-m or Kleinjung polynomial selection
• classical and lattice sieving
• sieving with smooth values only, Single- or Double- Large Prime Variation
• multiplatform (Win32, Linux, OSF-1; i386, PowerPC)
• sieving in distributed mode with messages transferred through shared folder

The following downloads are available:

source code documentation (Doxygen)	PDF
source code (C++)	tar.bz2
examples of sieve configuration	tar.bz2
Lukáš Perůtka: Searching optimal strategies for the number field sieve (Master Thesis)	PDF

The software authors: RNDr. Marian Kechlibar, Ph.D., RNDr. Přemysl Jedlička, Ph.D., Mgr. Jan Zvánovec, Mgr. Lukáš Perůtka, Mgr. Robert El Bashir, Dr., Mgr. Adéla Haníková, Bc. Anežka Pejlová, Mgr. Adéla Skoková

Mathematical guidance and supervision of the project: prof. RNDr. Aleš Drápal, CSc., DSc.