Description
Large integers can be factored with an implementation of the Number Field Sieve algorithm. It is useful for mathematical research, cryptography experiments, and benchmarking integer-factorization workflows.
This is a compute-heavy research tool, not a password cracker by itself. Factoring jobs can use substantial CPU, memory, and time, and cryptographic use should follow legal and ethical boundaries.