C-style arbitrary precision calculator

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.

EPR: A Factoring and Primality checking library for C++

Software to perform the LLR test with GNU MP, proving the primality of Riesel numbers of the form h*2^n-1

Integer Factorization Approaches with JavaScript

Information security lab - 7th semester

Software to perform the LLR test, proving the primality of Riesel numbers of the form h*2^n-1.

All you need to save time :p

Elgamal encrypted text hidden within pixels of images

Native Miller-Rabin GPU kernel for NVIDIA Blackwell - CGBN replacement

integer factorization progress tracker

Pocklington's criterion for primality in Coq [maintainer=@Casteran]

Verified primes of the form h*2^n-1 where h < 2^n

A simple Lucas-Lehmer primality test implementation for C++

Collection of several small tools. These tools stay here temporarily and may move to other major repositories as they evolve.

Studying the quality of different primality tests and finding ways to reduce pseudoprimes

Very long integer class and some methods for it

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

General-purpose cryptography library created as for a university course