Minimal elements for the base b representations of the prime numbers > b for the subsequence ordering, for 2 ≤ b ≤ 36

A Rust implementation of the Miller-Rabin primality test algorithm.

Cryptographic algorithms and attacks in Java 8

This repository contains C++ programs for efficiently checking if a number is prime and factorizing numbers into their prime factors.

A javascript implementation of the Miller-Rabin-Test.

A very fast async parallel generator for big/large prime numbers. Several prime numbers can be generated simultaneously via the bit or digit length.

RSA Encryption Algorithm

Collection of selected cryptographic algorithms implemented in Rust 🦀.

Projeto 2 da disciplina de Segurança Computacional da UnB em 2022.2

A library for number theory and modular arithmetic algorithms in Python e.g. Pollard Rho, Miller–Rabin primality test, Cipolla, etc.

A website that implements some number theory functions.

Very long integer class and some methods for it

The Pollard's Rho algorithm for 64/128 bits Integer Factorization in pure C.

Algorithms mentioned in Applied Cryptography (CSC15003)

Mathematical cryptography (custom implementations).

COM 5335 Network Security Assignment #3 - Miller-Rabin primality test and Rabin Public-Key Cryptosystem

Naive implementations of Miller-Rabin algorithm

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”.

Tests based on Fermat's little theorem and Miller-Rabin algorithm to check a number for primality.

C# : Nombres premiers avec crible d' Atkin et Eratosthène et test de primalité Miller Rabin ( C #: Prime numbers with Atkin and Eratosthenes sieve and Miller Rabin primality test )