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.
A Java math library focused on number theory and integer factorization in particular.
Pure C general-purpose integer factorization software released into the public domain, Quadratic Sieve.
R Package for Factoring Big Integers using the C Library GMP (GNU Multiple Precision Arithmetic)
A collection of Integer factorization algorithms
A collection of notes on mathematical Cryptography, ranging from classical methods through contemporary.
EPR: A Factoring and Primality checking library for C++
Very large integer factorization implemented in Python
Implementation of batch smoothness checking and factorization for Coppersmith's factorization factory.
The Pollard's Rho algorithm for 64/128 bits Integer Factorization in pure C.
A Practical Study and Comparison of Integer Factorization Methods
Prime decomposition of Kaprekar numbers (up to 29 digits)
素数判定法と素因数分解アルゴリズムに関する教科書(pythonコード付き)
A simple Python script used to sets of three integer factors that are different and have a common product. Created for a grade 8 mathematics problem.
A project that finds the two prime factors of a public key.
C++ port of DiffIntFactorTriplet. Much faster.
This project implements the Rabin Cryptosystem in SageMath, a public-key encryption algorithm based on the integer factorization problem. The system uses blum primes for p and q to simplify the decryption process.
Genetic algorithm for integer factorization w/ CUDA support.
DJB's batch GCD algorithm for fast factoring sequences of integers
Add a description, image, and links to the integer-factorization topic page so that developers can more easily learn about it.
To associate your repository with the integer-factorization topic, visit your repo's landing page and select "manage topics."