Elementary Number Theory for Integers in Rust
-
Updated
Dec 1, 2023 - Rust
Elementary Number Theory for Integers in Rust
A collection of mathematical algorithms in pure Rust
A demonstration of shamir secret sharing written in rust
ne plus ultra primality testing for machine-sized integers
Lenstra's Elliptic Curve Factorization Implementation in Rust
Fast discrete logarithm solver in Rust
Rust General Number Field Sieve
A naive, shitty rust implementation of the Reed-Solomon erasure codes algorithm
Input your cool random numbers and then get a function for the same.
An attempt at representing Goodstein sequences and hereditary base `n` notation in rust using standard traits.
Learning Rust with some number theory
Calculates all of the quadratic residues of any odd-prime powers. Furthermore, this can calculate the number of quadratic residues rapidly.
The practical materials in Rust for explaining number and group theory
Modular arithmetic library in Rust with generic number types. Supports no-std.
Finds the next prime(s) given an initial prime.
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."