Short explanations and implementations of different algorithms in multiple languages
-
Updated
Feb 1, 2024 - C++
Short explanations and implementations of different algorithms in multiple languages
Chebyshev polynomials of the first kind and primality testing
Poor man's big integer arithmetic operations
Miller-Rabin probabilistic primality test.
A collection of useful number theoretic functions. Contains several primality tests, and the ECM factoring algorithm as well.
Implementation of Miller Rabin Primality testing algorithm. If n is prime, the algorithm always returns “prime”. If n is composite, the algorithm with a probability of at least 1/2 returns “composite”.
EPR: A Factoring and Primality checking library for C++
Implementaciones del algoritmo de encriptación DES en C++ utilizando bitset, usigned char y unsigned int de 64 bits, algoritmo de Euclides, potenciación modular, test de primalidad de Miller-Rabin.
Solved tasks of "Randomized Algorithms" university course, contains implementations of main randomized algorithms.
Very long integer class and some methods for it
From basic algorithms like Sieve, Bitwise-sieve, Segmnted-sieve, Modular Arithmetic, Big Mod to Primality test, CRT etc. all other advance number theory algorithms.
A class to conduct Miller-Rabin primality test on any given integer smaller than 2^64-1
Minimal elements for the base b representations of the prime numbers > b for the subsequence ordering, for 2 ≤ b ≤ 36
Add a description, image, and links to the primality-test topic page so that developers can more easily learn about it.
To associate your repository with the primality-test topic, visit your repo's landing page and select "manage topics."