All Classes and Interfaces

Class	Description
AffinePoint<E>
BLS12381	Implementation of the BLS12-381 pairing-friendly elliptic curve construction.
Curve25519
EdwardsCurve<E,F extends dk.jonaslindstrom.ruffini.common.abstractions.Field<E>>	Instances of this class represents a curve over a field over elements of type E satisfying the equation x2 + y2 = 1 + d x2 y2.
EdwardsPoint<E>	Instances of this class represents a point on an Edwards Curve over a field with elements of type E.
JacobianPoint<E>
MillersAlgorithm<E>	Given two points P and Q of order m on an elliptic curve, this algorithm computes f(Q) where div(f) = [m]P - m[O].
MontgomeryCurve<E,F extends dk.jonaslindstrom.ruffini.common.abstractions.Field<E>>	Curve on Montgomery form By2 = x3 + Ax2 + x.
OptimalAtePairing<E1,E2,ET>	Compute the optimal Ate pairing.
ProjectivePoint<E>
Serialization
Serialization.Group
ShortWeierstrassCurveAffine<E,F extends dk.jonaslindstrom.ruffini.common.abstractions.Field<E>>
ShortWeierstrassCurveProjective<E>
WeilPairing<E>	Copmute the WeilPairing of two points on an elliptic curve.