nettrash-a 0.1.29

Algorithms in pure Rust with no dependencies: 23 sorting algorithms and a default sort; arbitrary-precision integers with Karatsuba, Toom-Cook and NTT multiplication, Newton division, GCD, roots, modular powers, primes and modular square roots; elliptic curves over prime fields with secp256k1, P-256, P-384, P-521, Curve25519 and Ed25519; complex numbers; matrices of floats, complex numbers or integers with LU, QR, Cholesky, SVD, Schur and eigendecompositions, exp, sqrt and log, and exact integer determinants and inverses. Not constant-time.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32

//! Elliptic curves over prime fields, with coordinates and scalars that are
//! [`Number`](crate::math::numbers::Number)s.
//!
//! * [`Weierstrass`], [`Montgomery`] and [`Edwards`]: the three forms of curve, each built from its
//!   coefficients and a prime of any length. What they share is the [`Curve`] trait: the points
//!   from their coordinates or their bytes, the discriminant, the `j`-invariant and the sum of many
//!   products.
//! * [`Point`]: a point of a curve, which adds with `+` and `+=`, subtracts with `-` and `-=`,
//!   negates with `-` and multiplies by a number with `*` and `*=`.
//! * [`Domain`]: a curve with a generator, its order and its cofactor; [`named`] holds those in
//!   common use: secp256k1, P-256, P-384, P-521, Curve25519 and Ed25519.
//!
//! **Nothing here is constant-time**: these are calculations on curves, and the time they take
//! depends on the scalars, as with [`pow_mod`](crate::math::numbers::Number::pow_mod), so they are
//! not meant for secret scalars such as private keys.

mod curve;
mod domain;
mod edwards;
mod field;
mod group;
mod montgomery;
pub mod named;
mod point;
mod weierstrass;

pub use curve::{Curve, CurveError, NotOnCurve};
pub use domain::Domain;
pub use edwards::Edwards;
pub use montgomery::Montgomery;
pub use point::{Point, Prepared};
pub use weierstrass::Weierstrass;