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.
R Package for Factoring Big Integers using the C Library GMP (GNU Multiple Precision Arithmetic)
Very large integer factorization implemented in Python
A Practical Study and Comparison of Integer Factorization Methods
Fast and efficient Fermat factorization CLI
A collection of Integer factorization algorithms
格子を用いた素因数分解法
Various number theory related functions (prime checking, integer factorization, etc.)
Prime decomposition of Kaprekar numbers (up to 29 digits)
emojinを用いて試し割法を行うemojin
素数判定法と素因数分解アルゴリズムに関する教科書(pythonコード付き)
DJB's batch GCD algorithm for fast factoring sequences of integers
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.
EPR: A Factoring and Primality checking library for C++
A project that finds the two prime factors of a public key.
Implementation of batch smoothness checking and factorization for Coppersmith's factorization factory.
Taxicab numbers up to T(18), their decomposition (and prime factor decomposition)
Genetic algorithm for integer factorization w/ CUDA support.
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."