FLINT (Fast Library for Number Theory)
Arb has been merged into FLINT -- use https://github.com/flintlib/flint/ instead
Convergence verification of the Collatz problem
🎓 Ciência da Computação - Universidade Federal do Ceará.
Analytic Number Theory high-precision GnuMP routines
A COLLECTION OF ALGORITHMS RELATED TO NUMBER THEORY
The goal of this repository is to find twin smooth integers of around 256 bits with prime sum, which can be used as public parameters in variants of the B_SIDH protocol.
C.Algebra System derived fron own Author works.
A program written in C to search for Magic Square of Squares.
Implementation of the research paper - http://crypto.stanford.edu/~xb/pkc07/fullgrpsigs.pdf
Rust low-level and high-level bindings for GMP-ECM.
This repository constains all the resolutions to the problems of Project Euler made by me so far.
A simple solution for using number theory to encrypt messages at Turing's scheme.
An iteration threshold table generator for the Miller-Rabin random probable prime search.
Mathematical Algorithms including Hashing, Encryption, and much more all in one project.
Riemann Zeta function.
Fast prime generator
Add a description, image, and links to the number-theory topic page so that developers can more easily learn about it.
To associate your repository with the number-theory topic, visit your repo's landing page and select "manage topics."