FLINT (Fast Library for Number Theory)
-
Updated
Jul 6, 2024 - C
FLINT (Fast Library for Number Theory)
Arb has been merged into FLINT -- use https://github.com/flintlib/flint/ instead
Analytic Number Theory high-precision GnuMP routines
The Quadratic Sieve algorithm for Integer Factorization up to 300+ bits in pure C.
🎓 Ciência da Computação - Universidade Federal do Ceará.
Implementation of the research paper - http://crypto.stanford.edu/~xb/pkc07/fullgrpsigs.pdf
Some popular cryptographic algorithms.
A COLLECTION OF ALGORITHMS RELATED TO NUMBER THEORY
A repo that contains implementation of classic cryptographic problems.
RSA cryptography college project
A collection of algorithms for solving number theory problems
C.Algebra System derived fron own Author works.
C library that provides a set of operations for elements of Galois field.
A simple solution for using number theory to encrypt messages at Turing's scheme.
Some necessary functions and tricks I use during problem solving.
Search for large Smith numbers of the form (6*10^879313+1)^a*10^b
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.
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."