Current section
21 Dependants
Jump to
Current section
21 Dependants
Packages depending on nstandard
21 packages-
A pure Elixir implementation of the AKS (Agrawal-Kayal-Saxena) primality test algorithm.
Updated 10 months ago
81 667recent downloads -
127recent downloads
-
A library for generating delta firmware compatible with fwup
Updated 2 months ago
104recent downloads -
An efficient implementation of the Lehmer GCD algorithm for computing the greatest common divisor of large integers in Elixir.
Updated 10 months ago
66recent downloads -
An efficient Elixir implementation of the binary GCD algorithm (Stein's algorithm) for computing the greatest common divisor (GCD) of two or more non-negative integers using only bitwise operations...
Updated 10 months ago
48recent downloads -
A fast implementation of the binary extended GCD algorithm for Elixir.
Updated 10 months ago
47recent downloads -
A fast and efficient Elixir library for calculating modular multiplicative inverses.
Updated 10 months ago
46recent downloads -
A fast and efficient Elixir library for prime factorization of integers.
Updated 10 months ago
42recent downloads -
A fast and efficient Elixir library for counting trailing zeros in the binary representation of integers.
Updated 10 months ago
40recent downloads -
A high-performance Elixir library for efficient modular arithmetic using Montgomery reduction.
Updated 10 months ago
37recent downloads -
A utility library for finding common factors of 2 between two numbers using efficient bitwise operations.
Updated 10 months ago
30recent downloads -
A pure Elixir implementation of the Crandall reduction algorithm for efficient modular arithmetic.
Updated 10 months ago
27recent downloads -
SvPortSim: Elixir interface for driving Verilated SystemVerilog modules through Ports, with each simulation instance managed as a GenServer.
Updated 45 minutes ago
27recent downloads -
A utility library for calculating the bit length of integers in Elixir.
Updated 10 months ago
26recent downloads -
A high-performance implementation of the greatest common divisor (GCD) algorithm that combines binary GCD with Lehmer's algorithm for optimal performance on large integers.
Updated 10 months ago
25recent downloads -
A mathematical library for detecting perfect powers in Elixir.
Updated 10 months ago
25recent downloads -
A probabilistic primality test implementation in Elixir based on Fermat's Little Theorem.
Updated 10 months ago
25recent downloads