trial-division

EPR: A Factoring and Primality checking library for C++

Comparing efficiency of prime number algorithms, including the Sieve of Eratosthenes and Trial Division, with different optimization techniques such as multiprocessing and GPU computing (CUDA).

The minimal elements of the prime numbers which are > b written in the positional numeral system with radix b, as digit strings under the subsequence ordering, for 2 ≤ b ≤ 36

A Practical Study and Comparison of Integer Factorization Methods

A high-performance command-line tool for comparing different primality testing algorithms, written in Rust

University project mainly involving Mersenne numbers.

RSA Factoring Challenge

For FoSIC Assignment - Deterministic & Probabilistic Prime Tetsing

Very Large / Arbitrary Precision Prime Factorization with GMP, ECM-GMP, CUDA, CGBN and MPI

Arbitrary Precision Prime Number Finder

A command line utility to calculate the divisors of an integral.

Algorithms to find prime numbers

Hardware prime number checker — trial division + Miller-Rabin on SKY130 ASIC via Tiny Tapeout

Check if a given number is prime using trial division

emojinを用いて試し割法を行うemojin

Fully deterministic primality: OpenMP wheel, BLS below 256 bits, FastECPP at 256+ bits. No stochastic Miller–Rabin.

Trial division, Fermat, Miller-Rabin, Solovay–Strassen and Lucas primality tests