Prime decomposition of Kaprekar numbers (up to 29 digits)
-
Updated
Dec 23, 2025
Prime decomposition of Kaprekar numbers (up to 29 digits)
Taxicab numbers, upper bounds up to BTa(23), their decomposition x³ + y³ (and prime factor decomposition)
A Python implementation of the General number field sieve algorithm for factoring large integers
Various number theory related functions (prime checking, integer factorization, etc.)
A Java math library focused on number theory and integer factorization in particular.
DJB's batch GCD algorithm for fast factoring sequences of integers
A Python implementation of the Quadratic sieve algorithm for factoring large integers
EPR: A Factoring and Primality checking library for C++
Quadratic Sieve implementation for large integer factorization using GMP for arbitrary precision arithmetic and MPI for parallel distributed sieving. Includes smooth relation collection, Gaussian elimination over GF(2), and non-trivial factor extraction on 40–50 digit numbers.
High-performance integer factorization suite implementing GNFS, MPQS, and QS algorithms with optimized lattice reduction, vectorization, GPU acceleration, and tensor-based linear algebra. Features automatic algorithm selection, NUMA-aware scheduling, and checkpoint/restore for computational number theory research and cryptanalytic analysis.
Fast and efficient Fermat factorization CLI
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 collection of notes on mathematical Cryptography, ranging from classical methods through contemporary.
格子を用いた素因数分解法
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.
emojinを用いて試し割法を行うemojin
A collection of Integer factorization algorithms
R Package for Factoring Big Integers using the C Library GMP (GNU Multiple Precision Arithmetic)
素数判定法と素因数分解アルゴリズムに関する教科書(pythonコード付き)
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."