A COLLECTION OF ALGORITHMS RELATED TO NUMBER THEORY
-
Updated
Jun 26, 2024 - C
A COLLECTION OF ALGORITHMS RELATED TO NUMBER THEORY
Finding Sets of Positive Integers from which you can not Construct an Arithmetic Expression that Evaluates to Zero
OpenCL program for trial factoring Mersenne numbers, used in the Great Internet Mersenne Prime Search (GIMPS)
FLINT (Fast Library for Number Theory)
C library that provides a set of operations for elements of Galois field.
This repository contains solutions of various problems that I solved on different online judges.
Arb has been merged into FLINT -- use https://github.com/flintlib/flint/ instead
Analytic Number Theory high-precision GnuMP routines
Mathematical Algorithms including Hashing, Encryption, and much more all in one project.
🎓 Ciência da Computação - Universidade Federal do Ceará.
The Quadratic Sieve algorithm for Integer Factorization up to 300+ bits in pure C.
Some necessary functions and tricks I use during problem solving.
The Pollard's Rho algorithm for 64/128 bits Integer Factorization in pure C.
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.
Command-line application that encrypts and decrypts files using Asymmetric Cryptography.
An iteration threshold table generator for the Miller-Rabin random probable prime search.
This repository constains all the resolutions to the problems of Project Euler made by me so far.
Number theory experiments
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."