A portfolio of fundamental number-theoretic and cryptographic algorithms implemented in Java for the Reichman University Topics in CS Honors course.
-
Updated
Mar 29, 2026 - Java
A portfolio of fundamental number-theoretic and cryptographic algorithms implemented in Java for the Reichman University Topics in CS Honors course.
Blazing-fast prime number engine: segmented sieve + worker_threads + native crypto. 100x faster than trial division. Supports BigInt/Miller-Rabin for primes near 10^15.
A high-performance library for primality testing using Miller-Rabin and Fermat algorithms.
A high-performance command-line tool for comparing different primality testing algorithms, written in Rust
High-performance search and analysis of productive numbers (OEIS A089395) using Rust
A modular cryptography engine implementing an optimized ElGamal pipeline with large-prime generation, block-level file encryption, and multithreaded acceleration. Demonstrates practical skills in number theory, security engineering, performance optimization, and high-throughput Python system design
Bibliothèque Python pour la génération et le test de nombres premiers avec des algorithmes optimisés (crible d'Ératosthène, Miller-Rabin) et export CSV.
Pure-Python implementation of the Rabin-Miller primality test.
EPR: A Factoring and Primality checking library for C++
RSA Implementation in Python3 without crypto libs
For FoSIC Assignment - Deterministic & Probabilistic Prime Tetsing
This repository contains implementations of various primality testing algorithms, including both deterministic and probabilistic methods. The algorithms are designed and coded in Java, suitable for educational purposes, research, and performance comparison.
A multithreaded Python3 implementation of Miller-Rabin probabilistic primality testing.
A Rust implementation of the Miller-Rabin primality test algorithm.
A Go library for checking whether an integer is prime or not, using either the AKS or Miller-Rabin algorithms.
popular algorithm here
Fast primality testing algorithm for javascript (using Miller-Rabin test)
Finds the next prime(s) given an initial prime.
Trabalho desenvolvido na disciplina de Segurança em Computação (INE5429).
Implementation of the RSA algorithm | Python | Command-line interface | Miller-Rabin | Extended Euclidean algorithm
Add a description, image, and links to the miller-rabin topic page so that developers can more easily learn about it.
To associate your repository with the miller-rabin topic, visit your repo's landing page and select "manage topics."