Packages depending on nstandard
20 packages-
A pure Elixir implementation of the AKS (Agrawal-Kayal-Saxena) primality test algorithm.
Published 8 months ago
83 418recent downloadstotal downloads: 83 614 -
174recent downloadstotal downloads: 13 042
-
A library for generating delta firmware compatible with fwup
Published 8 months ago
97recent downloadstotal downloads: 163 -
An efficient implementation of the Lehmer GCD algorithm for computing the greatest common divisor of large integers in Elixir.
Published 8 months ago
91recent downloadstotal downloads: 275 -
A fast implementation of the binary extended GCD algorithm for Elixir.
Published 8 months ago
79recent downloadstotal downloads: 662 -
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...
Published 8 months ago
77recent downloadstotal downloads: 1 981 -
A fast and efficient Elixir library for calculating modular multiplicative inverses.
Published 8 months ago
61recent downloadstotal downloads: 760 -
A fast and efficient Elixir library for prime factorization of integers.
Published 8 months ago
61recent downloadstotal downloads: 180 -
A high-performance Elixir library for efficient modular arithmetic using Montgomery reduction.
Published 8 months ago
54recent downloadstotal downloads: 603 -
A fast and efficient Elixir library for counting trailing zeros in the binary representation of integers.
Published 8 months ago
51recent downloadstotal downloads: 141 -
A pure Elixir implementation of the Crandall reduction algorithm for efficient modular arithmetic.
Published 8 months ago
46recent downloadstotal downloads: 108 -
A utility library for finding common factors of 2 between two numbers using efficient bitwise operations.
Published 8 months ago
42recent downloadstotal downloads: 118 -
A utility library for calculating the bit length of integers in Elixir.
Published 8 months ago
40recent downloadstotal downloads: 106 -
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.
Published 8 months ago
37recent downloadstotal downloads: 110 -
A probabilistic primality test implementation in Elixir based on Fermat's Little Theorem.
Published 8 months ago
31recent downloadstotal downloads: 85 -
A mathematical library for detecting perfect powers in Elixir.
Published 8 months ago
30recent downloadstotal downloads: 84