-
dispatch
Rust wrapper for Apple's Grand Central Dispatch
-
gcd
Calculate the greatest common divisor
-
gcdn
An algorithmically faster implementation of variadic GCD
-
rdcl_aoc_helpers
Helpers for Advent of Code
-
gcdx
Calculate the greatest common divisor of multiple values
-
gcd-bitwise
The binary Euclidean algorithm for computing gcd
-
dispatch-executor
An asynchronous executor for Apple's Grand Central Dispatch
-
bulk-gcd
Fast parallel bulk GCD computation for finding weak RSA keys in a set
-
dispatchr
Drew's Rust bindings for libdispatch, a.k.a. GCD
-
play-rsa
RSA cryptography in Rust for pedagogical use
-
arkley_traits
several traits for common mathematical operations
-
chiavdf
Bindings to the chiavdf C++ library
-
gf2poly
GF(2) polynomial arithmetic
-
chikvdf
Bindings to the chikvdf C++ library
-
polymatheia
Mathematical types, traits, and algorithms in pure and safe Rust
-
extended-euclidean-algorithm
computes the greatest common divisor of 2 natural numbers and 2 additional numbers such that gcd(a,b)=s·a+t·b holds
-
ggt
calculate the ggt
-
rscmm
C-interpreter
-
modular_arithmetic
memory safe modular arithmetic with some number theoretic functions: GCD, Jacobi symbol, even/odd powers
-
gcd_
to calculate the greatest common divisor
-
competitive-programming-lib
Competitive Programming Library
Try searching with DuckDuckGo.