The basic algorithms of cryptography
-
Updated
Dec 26, 2019 - C++
The basic algorithms of cryptography
A General Number Field Sieve (GNFS) implementation written from the ground up in C++, C, and x86_64 NASM.
GPU-accelerated elliptic curve cycle search over p = 2^255 - 19 using CUDA-parallel Cornacchia solving, Jacobi filtering, and full twist order
Bash wrappers for PARI/GP exploring classical number theory — Riemann zeta zeros, Gilbreath's conjecture, prime gaps, Möbius function, Goldbach partitions, Euler product approximations of π, Dirichlet L-function zeros, Liouville function, von Mangoldt function, Euler totient, Carmichael function, and Jacobi symbol.
Add a description, image, and links to the jacobi-symbol topic page so that developers can more easily learn about it.
To associate your repository with the jacobi-symbol topic, visit your repo's landing page and select "manage topics."