Struct EdwardsConfig 

pub struct EdwardsConfig;

Trait Implementations

impl Clone for EdwardsConfig

fn clone(&self) -> EdwardsConfig

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl CurveConfig for EdwardsConfig

const COFACTOR: &'static [u64]

COFACTOR = 8

const COFACTOR_INV: Fr

COFACTOR_INV (mod r) = 2713877091499598330239944961141122840321418634767465352250731601857045344121

type BaseField = Fp<MontBackend<FqConfig, 4>, 4>

Base field that the curve is defined over.

type ScalarField = Fp<MontBackend<FrConfig, 4>, 4>

Finite prime field corresponding to an appropriate prime-order subgroup of the curve group.

fn cofactor_is_one() -> bool

impl Default for EdwardsConfig

fn default() -> EdwardsConfig

Returns the “default value” for a type.

impl MontCurveConfig for EdwardsConfig

const COEFF_A: Fq

COEFF_A = 486662

const COEFF_B: Fq

COEFF_B = 57896044618658097711785492504343953926634992332820282019728792003956564333285 This is not one, because ed25519 != curve25519

type TECurveConfig = EdwardsConfig

Model parameters for the Twisted Edwards curve that is birationally equivalent to this curve.

impl PartialEq for EdwardsConfig

fn eq(&self, other: &EdwardsConfig) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl TECurveConfig for EdwardsConfig

const COEFF_A: Fq

COEFF_A = -1

const COEFF_D: Fq

COEFF_D = -121665 / 121666

const GENERATOR: EdwardsAffine

Standard generators from https://neuromancer.sk/std/other/Ed25519.

fn mul_by_a(elem: Self::BaseField) -> Self::BaseField

Multiplication by a is just negation.

type MontCurveConfig = EdwardsConfig

Model parameters for the Montgomery curve that is birationally equivalent to this curve.

fn is_in_correct_subgroup_assuming_on_curve(item: &Affine<Self>) -> bool

Checks that the current point is in the prime order subgroup given the point on the curve.

fn clear_cofactor(item: &Affine<Self>) -> Affine<Self>

Performs cofactor clearing. The default method is simply to multiply by the cofactor. For some curve families though, it is sufficient to multiply by a smaller scalar.

fn mul_projective(base: &Projective<Self>, scalar: &[u64]) -> Projective<Self>

Default implementation of group multiplication for projective coordinates

fn mul_affine(base: &Affine<Self>, scalar: &[u64]) -> Projective<Self>

Default implementation of group multiplication for affine coordinates

fn msm( bases: &[Affine<Self>], scalars: &[Self::ScalarField], ) -> Result<Projective<Self>, usize>

Default implementation for multi scalar multiplication

fn serialize_with_mode<W>( item: &Affine<Self>, writer: W, compress: Compress, ) -> Result<(), SerializationError>

where W: Write,

If uncompressed, serializes both x and y coordinates. If compressed, serializes y coordinate with a bit to encode whether x is positive.

fn deserialize_with_mode<R>( reader: R, compress: Compress, validate: Validate, ) -> Result<Affine<Self>, SerializationError>

where R: Read,

If validate is Yes, calls check() to make sure the element is valid.

fn serialized_size(compress: Compress) -> usize

impl Eq for EdwardsConfig

impl StructuralPartialEq for EdwardsConfig