There are 0 repository under primality-testing topic.
Contains solutions and codes to various online competitive programming challenges and some good problems. The links to the problem sets are specified at the beginning of each code.
Optimized AKS Primality Test with Fast Fourier Transform (FFT) for enhanced performance in large number primality checking. This implementation improves the efficiency of the AKS algorithm using FFT for polynomial multiplication, offering significant speedup.
Integer Factorization Approaches with JavaScript
Software to perform the LLR test with GNU MP, proving the primality of Riesel numbers of the form h*2^n-1
Software to perform the LLR test, proving the primality of Riesel numbers of the form h*2^n-1.
Information security lab - 7th semester
All you need to save time :p
Elgamal encrypted text hidden within pixels of images
Verified primes of the form h*2^n-1 where h < 2^n
Collection of several small tools. These tools stay here temporarily and may move to other major repositories as they evolve.
Pocklington's criterion for primality in Coq [maintainer=@Casteran]
Some stuff ...
An iteration threshold table generator for the Miller-Rabin random probable prime search.
A very fast async parallel generator for big/large prime numbers. Several prime numbers can be generated simultaneously via the bit or digit length.
Functions in Python doing prime stuff.
素数判定法と素因数分解アルゴリズムに関する教科書(pythonコード付き)
General-purpose cryptography library created as for a university course
Studying the quality of different primality tests and finding ways to reduce pseudoprimes
Implementation of the AKS primality test in python
A set of data structures and algorithms I have implemented for fun. Most of the algorithms are just tested for functionality using toy examples.
integer factorization progress tracker
https://username1565.github.io/Javascript-Primality-Tester/
A collection of implemented cryptography algorithms and optimizations.
A python script that would check the primality of positive integers.
Simply put, this program is a primality test program, it tests whether a number you input is prime or not using one of today's most modern efficient methods of primality testing: miller's test.
An exploration of the integer sequence: Mersenne Primes
Probabilistic approach to primality testing
Pure-Python implementation of the Rabin-Miller primality test.
A Mersenne Primality Test that implements the Lucas-Lehmer Test
visited algorithms explanation and code