-
primeorder
Pure Rust implementation of complete addition formulas for prime order elliptic curves (Renes-Costello-Batina 2015). Generic over field elements and curve equation coefficients
-
primal-check
Fast standalone primality testing
-
glass_pumpkin
A cryptographically secure prime number generator based on rust's own num-bigint and num-integer
-
feanor-math
number theory, providing implementations for arithmetic in various rings and algorithms working on them
-
num-prime
Generic and optimized primality test, factorization and various number theoretic functions with arbitrary precision based on
num -
crypto-primes
Random prime number generation and primality checking library
-
machine-prime
ne plus ultra primality testing for machine-sized integers
-
const-primes
Work with prime numbers in const contexts. Prime generation, primality testing, prime counting, and more.
-
unknown_order
working with finite fields where the modulus is of unknown order, typtical for RSA, Paillier, Hyperelliptic curves, etc
-
primal
primalputs raw power into prime numbers. This crates includes: optimised prime sieves, checking for primality, enumerating primes, factorising numbers, and state-of-the-art estimation of upper and… -
number-theory
Fast primality, factorization and elementary number theory for integer types
-
concrete-ntt
pure Rust high performance number theoretic transform library
-
primefield
Macros for generating prime field implementations
-
math-comb
Math library for Combinatorics, Modular arithmetic & Number Theory utilities
-
prime_finder_rust
A prime finder made in Rust (originally made in c++)
-
finitelib
advanced maths over finite groups, fields, their extensions, multi precision operations, euclidean rings, polynomials and related things
-
prime-factor
A prime number factorizer written in Rust
-
generalized-paillier
Original Paillier encryption and generallized Paillier encrytion, i.e. Damgard-Jurik scheme
-
ffnt
Finite fields for number theory
-
ulam
calculations
-
ecm
Lenstra's Elliptic Curve Factorization Implementation with Big Integers
-
stark-curve
Stark curve implementation
-
is_prime
Fast arbitrary length prime number checker using the Miller-Rabin primality test algorithm
-
prime-checker
hold sample functions to check the prime-ness of a given unsigned, 64-bit integer
-
tfhe-ntt
pure Rust high performance number theoretic transform library
-
nums
Number theoretic functions, such as primality testing and factorization, for BigUints
-
codemonk-primes-cli
A command-line utility for finding prime numbers
-
primal-sieve
A high performance prime sieve
-
large-primes
Package for Large Prime Number Analysis
-
rand-unique
A no-std crate for generating random sequences of unique integers in O(1) time
-
cosmian_crypto_base
Crypto lib for hybrid encryption and pure crypto primitives
-
nut_sys
Wrapper for Number-Theory-Utils C library
-
rug-miller-rabin
A multi-threaded, arbitrary precision implementation of the Miller-Rabin primality test using rug (GMP)
-
factorial
Convenient methods to compute the factorial, optionally checked
-
rust-miller-rabin
Miller-Rabin primality test
-
squfof
Shanks's square forms factorization
-
rand-sequence
A no-std crate for generating random sequences of unique integers in O(1) time
-
num-primes
Generating Large Prime and Composite Numbers using num with a simplistic interface
-
c-prime
Convenience wrapper for machine-prime
-
primal-bit
Bit-vector specialised to the prime-number-related needs of
primal -
gmp-ecm
Rust high-level bindings for GMP-ECM
-
primal-estimate
State-of-the-art estimation of upper and lower bounds for π(n) (the number of primes below n) and p_k (the k-th prime)
-
miller_rabin
A multi-threaded, arbitrary precision implementation of the Miller-Rabin primality test
-
stella
software that finds prime k-tuplets (also called prime constellations)
-
prime_bag
A bag datatype that used unsigned integers for storage
-
lazy-prime-sieve
Lazy Sieve of Eratosthenes for infinitely generating primes lazily in Rust
-
primal-slowsieve
sieve of Eratosthenes designed for testing faster sieves. You probably want
primal-sieve, or even justprimalitself. -
primecount
Rust wrapper for https://github.com/kimwalisch/primecount
-
factordb
Rust wrapper for FactorDB API
-
classygroup
The Classy Group
-
primeval
A monstrosity of a prime number generator
-
pumpkin
A cryptographically secure prime number generator
-
ramp-primes
Generating Large Prime and Composite Numbers using ramp with a simplistic interface
-
pallet-collective
Collective system: Members of a set of account IDs can make their collective feelings known through dispatched calls from one of two specialized origins
-
Gen_Prime
A way to transform a hash to a prime number
-
pallet-membership
FRAME membership management pallet
-
primerug
A prime k-tuple finder based on the rug crate
-
cargo-primestack
help run the prime stack
-
rprime
useful functions for prime numbers
-
lib_algorithms
Библиотека алгоритмов
-
primeshor
project to explore prime numbers and factorization
-
viewp
A program is get any argument, that generates prime. it argument be number. This Program is Test Stage.
-
concurrent_prime_sieve
Tools for generating filters and collections with primes concurrently. Rust implementation of the Sieve of Atkin. This implementation runs in O( sqrt(max_num) + section_size ) (where section_size = max_num - min_num)…
-
rsa_rs
rust rsa library -- UNTESTED HOBBY PROJECT -- DO NOT USE FOR SERIOUS APPLICATIONS
-
gmp-ecm-sys
Rust low-level bindings for GMP-ECM
-
is-prime-for-primitive-int
is_prime for primitive ineger type
-
facto
Integer factorization and prime certification
-
ssmr
Single-Shot Miller-Rabin primality test for small integers
-
prime-data
Prime Number Data Library
-
nt-primes
Recreational mathematics crate for various forms of primes
-
typenum-prime
compile-time primality testing of type-level integers from the typenum crate
-
eratosthenes
Mathematical operations library for Rust
-
elr_primes
prime number iterator and methods for basic calculations with prime numbers
-
play-rsa
RSA cryptography in Rust for pedagogical use
-
plummerprimes
Builds, Runs, and reports benchmarks from https://github.com/PlummersSoftwareLLC/Primes
-
factor-rs
A command-line program for listing the prime factors of a number or fraction
-
primenumbe-rs
Generate the nth prime number
-
primality-test
Primality Test crate
-
mersenne-prime-number-miller-rabin
This package provides function to generate Mersenne number and test primality with Miller-Rabin Algorithme
-
ImtiazGermain
that checks if a number is a Germain and Imtiaz-Germain prime or not
-
primality
Check if a number is prime
-
fedora-prime
Switching between intel/nvidia drivers made simple
-
pollard-p-minus-one
Pollard's p-1 factoring algorithm
-
prime_gen
Generate prime numbers
-
optimus
ID hashing and Obfuscation using Knuth's Algorithm
-
primeish
A CLI containing various prime number utilities
-
prim
find prime numbers
-
fractran
execute Fractran programs
-
prime_tools
Generate primes, get prime factors, check primality, and other useful prime-related utilities
-
prime-iter
An incremental-sieve based prime generator
-
prime-rs
Command line utilities for finding prime numbers
-
distributed-cards
Implements the mental poker shuffling algorithm
-
scicrypt-numbertheory
A scicrypt crate implementing number theoretic algorithms such as random (safe) prime generation
-
prime-number-utils
generate prime numbers and to determine whether a number is prime efficiently
-
bubblemath
A collection of mathematical algorithms in pure Rust
-
shanksbot-rs
ShanksBot shown by Matt Parker in https://www.youtube.com/watch?v=DmfxIhmGPP4
-
prime-portraits
A program that turns images into prime numbers
-
factorprime
finding whether a number is prime or not and also determine its factors
-
poseidon-paramgen
generating Poseidon parameters
-
algebraic-equation-over-finite-prime-field
solve algebraic equation over finite prime field
-
primefactor
finding whether a number is prime or not and also determine its factors
-
next_prime
A function that returns the next prime greater than or equal to its argument
-
factor-prime
finding whether a number is prime or not and also determine its factors
-
red_primality
zero-setup primality testing and factoring for all u64
-
sfcpl
private library for atcoder
-
is-prime2
check if a number is prime
-
prime_bench
A prime finding benchmarking tool
Try searching with DuckDuckGo.