GNFS

A complete, proof-of-concept, C# implementation of the General Number Field Sieve algorithm for factoring very large semi-prime numbers. The focus was on readability and understandability of the code, not performance.

math

View on GitHub

57 Stars

13 Forks

57 Watchers

C# Language

gpl-3.0 License

Cost to Build

$6.63M

Market Value

$12.27M

How is this calculated?

Growth over time

7 data points · 2021-08-01 → 2025-03-01

Stars Forks Watchers

💬

How do you feel about this project?

Ask AI about GNFS

Question copied to clipboard

What is the AdamWhiteHat/GNFS GitHub project? Description: "A complete, proof-of-concept, C# implementation of the General Number Field Sieve algorithm for factoring very large semi-prime numbers. The focus was on readability and understandability of the code, not performance.". Written in C#. Explain what it does, its main use cases, key features, and who would benefit from using it.

Question is copied to clipboard — paste it after the AI opens.

How to clone GNFS

Clone via HTTPS

git clone https://github.com/AdamWhiteHat/GNFS.git

Clone via SSH

[email protected]:AdamWhiteHat/GNFS.git

Download ZIP

Download master.zip

Found an issue?

Report bugs or request features on the GNFS issue tracker:

Open GitHub Issues

Similar to GNFS

freeCodeCamp freecodecamp.cn mathjs gpu.js sympy Surge simple-statistics mlcourse.ai libchaos cute_headers mathnet-numerics stdlib RandomKit mathquill osmnx math-php Euler stats phobos sage-archive-2023-02-01 Project-Euler-solutions swix pragmatapro expr-eval Sophus long.js primesieve libRmath.js symengine AlgebraicEngine-Fraction