Uses of Package
net.i2p.crypto.eddsa.math
Package
Description
Java implementation of EdDSA, a digital signature scheme using
a variant of elliptic curve cryptography based on Twisted Edwards curves.
Data structures that definie curves and fields, and
the mathematical operaions on them.
Low-level, non-optimized implementation using BigIntegers for any curve.
Low-level, optimized implementation using Radix $2^{51}$ for Curve 25519.
Specifications for curves and keys, and a table for named curves.
-
-
ClassDescriptionA twisted Edwards curve.Common interface for all $(b-1)$-bit encodings of elements of EdDSA finite fields.An EdDSA finite field.Note: concrete subclasses must implement hashCode() and equals()A point $(x,y)$ on an EdDSA curve.Available representations for a group element.
-
ClassDescriptionCommon interface for all $(b-1)$-bit encodings of elements of EdDSA finite fields.An EdDSA finite field.Note: concrete subclasses must implement hashCode() and equals()
-
ClassDescriptionCommon interface for all $(b-1)$-bit encodings of elements of EdDSA finite fields.An EdDSA finite field.Note: concrete subclasses must implement hashCode() and equals()
-
ClassDescriptionA twisted Edwards curve.A point $(x,y)$ on an EdDSA curve.