Browse Code
This is an easy-to-understand algorithm of integer factorization with heuristically evaluated complexity L(4/15, 2), which is better than the general number field sieve algorithm with L(1/3, 1.923).
NFB searches common factors of the quadratic residues modulo n using GCD. All relations are processed by the Gaussian elimination procedure. Different strategies of searching the relations can be applied, many giving complexity better than L(1/3, 1.923).
Features
- no-factor-base
- gcd
- factorization
- integer
- congruence-of-squares
Project Samples
Follow NFB integer factorization
Other Useful Business Software
Passwordless Authentication and Passwordless Security
It’s no secret — passwords can be a real headache, both for the people who use them and the people who manage them. Over time, we’ve created hundreds of passwords, it’s easy to lose track of them and they’re easily compromised. Fortunately, passwordless authentication is becoming a feasible reality for many businesses. Duo can help you get there.
Rate This Project
Login To Rate This Project
User Reviews
-
You do not need to be a specialist in number theory to comprehend this algorithm and try different strategies of searching quadratic residues mod N . Good for home research in number theory :) or as a material for a diploma thesis. Significant work is needed to parallelize this on GPU or CPU for factorization of really large numbers.