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

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

Naive implementations of Miller-Rabin algorithm

Cryptography course - Cryptography modules - classic chipers - DES function f - Number theory module

Collection of selected cryptographic algorithms implemented in Rust 🦀.

RSA encryption and digital signature implementation

RSA Encryption Algorithm

Mathematical cryptography (custom implementations).

Implementation of 1024 Bit RSA Algorithm

Very long integer class and some methods for it

Challenges performed during the course ADVANCED ALGORITHMS AND PARALLEL PROGRAMMING of Politecnico di Milano during the academic year 2025/2026. Mark: 6/6

a straight-forward prime generator (Miller-Rabin) and a naive implementation of the RSA algorithm

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

Prime Number Generator is a C-based program designed to generate prime numbers demonstrating parallel computing principles

Algorithms mentioned in Applied Cryptography (CSC15003)

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

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 )

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

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

Cryptographic algorithms and attacks in Java 8