GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Build software better, together
#
integer-factorizationHere are 50 public repositories matching this topic...Language: All
Filter by language
Sort: Most stars
Sort options
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.
cryptography csharp math mathematics numerics number-theory factoring-integers integer-factorization lenstra
A Java math library focused on number theory and integer factorization in particular.
java quaternions integer-factorization logarithm pollard-rho quadratic-sieve prime-sieve elliptic-curve-factorization highly-composite-number siqs four-square lehman-factorization hart-factorization squfof cfrac exponential-function partition-generator abundant-number gaussian-integers
Perl number theory module using XS/GMP
perl prime-numbers number-theory integer-factorization sieve-of-eratosthenes perl-xs c-programming-language prime-counting
R Package for Factoring Big Integers using the C Library GMP (GNU Multiple Precision Arithmetic)
algorithm gmp prime-factorizations integer-factorization primes quadratic-sieve mpqs quadratic-sieve-algorithm
EPR: A Factoring and Primality checking library for C++
gcd ecm factorization integer-factorization primality-testing sieve-of-eratosthenes pollard-rho primality-test greatest-common-divisor pollard-rho-algorithm factoring miller-rabin trial-division primality lenstra miller-rabin-algorithm elliptic-curve-factorization
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.
python cryptography cryptanalysis algorithms optimization rsa computational-mathematics high-performance-computing gpu-acceleration vectorization number-theory integer-factorization lattice-reduction tensor-networks algebraic-number-theory quadratic-sieve mpqs montgomery-arithmetic bkz gnfs
A collection of notes on mathematical Cryptography, ranging from classical methods through contemporary.
education security cryptography crypto math mathematics rsa cybersecurity how-to number-theory integer-factorization caesar-cipher shift-cipher elgamal discrete-logarithm feistel feistel-network viginere
A collection of Integer factorization algorithms
Multi-backend ECM stage-1 & satge-2 engine (OpenCL · CUDA/CGBN · AVX-512 IFMA) with GMP-ECM & Prime95 savefile interop and a worktodo queue manager.
Алгоритм факторизации чисел методом квадратичного решета
Taxicab numbers, upper bounds up to BTa(23), their decomposition x³ + y³ (and prime factor decomposition)
math mathematics decomposition flint maths prime-factorizations bignumber integer-factorization prime-factors bignumbers big-number taxicab-number taxicab prime-factorization prime-factorisation oeis-a011541
Berry ecosystems opensource optimation quantize student model precise+very fast with LUT lookups
quant integer-compression integer quantization integer-factorization integer-arithmetic integers integer-programming integer-sequences qat teacher-student-learning integer-overflow integer-scaling teacher-student-training berrybits berryquantitation fp32-teach fp16-teach q8-student q4-student
CADO-NFS (modern): an enhanced modernization + performance fork of CADO-NFS (Number Field Sieve — integer factorization & discrete log) on current toolchains. Adds GPU linear algebra + full vector residency, a GPU ECM pre-factoring front-end, SDE-validated AVX-512 VPCLMULQDQ/IFMA kernels, and Rust orchestration. LGPL-2.1.
python cryptography cpp hpc nfs factorization number-theory integer-factorization discrete-logarithm number-field-sieve cado-nfs modernization-fork
A Python implementation of the General number field sieve algorithm for factoring large integers
python graph-algorithms integer-factorization gaussian-elimination general-number-sieve lanczos-algorithm wiedemann
Very large integer factorization implemented in Python
Implementation of batch smoothness checking and factorization for Coppersmith's factorization factory.
A classical teaching tool for exploring the number theory at the heart of Shor’s algorithm through interactive period finding, FFT visualizations, factor extraction, and honest experimental benchmarks.
react python cryptography typescript quantum-computing interactive-learning number-theory integer-factorization quantum-algorithms period-finding shors-algorithm fastapi educational-tool streamlit
Fast integer factorization in Rust with Lenstra's elliptic curve method (ECM), P-1 and P+1.
ecm prime-numbers factorization number-theory integer-factorization primes lenstra elliptic-curve-method
Fast portable C/GMP integer factorization using SIQS (Self-Initializing Quadratic Sieve), including pthreads parallelism.
parallel-computing pthreads ecm gmp factorization number-theory integer-factorization c-programming-language quadratic-sieve siqs
A GPU implementation of ECM stage 2
Add this topic to your repoTo associate your repository with the integer-factorization topic, visit your repo's landing page and select "manage topics." |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |