FLINT (Fast Library for Number Theory)
-
Updated
Aug 4, 2025 - C
FLINT (Fast Library for Number Theory)
C and MATLAB implementation of CS recovery algorithm, i.e. Orthogonal Matching Pursuit, Approximate Message Passing, Iterative Hard Thresholding Algorithms
A factorization software using a Quadratic Sieve (SIQS) written in C.
Factorization based image segmentation algorithm
Big-integer calculator with factorization
The Pollard's Rho algorithm for 64/128 bits Integer Factorization in pure C.
Some C/C++ basics and algorithms
RSAbrk is a C program for factoring semiprime numbers, i.e., numbers formed by the product of two large prime numbers (P and Q). It was created for fun and exploration of number theory, and features two different implementations: RSAbrk_v1 and RSAbrk_v2.
Final project for CS 374 HPC class
RSA Analyzer, based on BigInteger architecture and David Sole's CPC Theoreme
An incredibly inefficient attempt to factor a number that is too large to have any hope of success
Factorization Race : Crack RSA integer as quickly as possible
Add a description, image, and links to the factorization topic page so that developers can more easily learn about it.
To associate your repository with the factorization topic, visit your repo's landing page and select "manage topics."