Struct PallasConfig

pub struct PallasConfig;

Trait Implementations

impl Clone for PallasConfig

fn clone(&self) -> PallasConfig

Returns a copy of the value.

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

Performs copy-assignment from source.

impl CurveConfig for PallasConfig

const COFACTOR: &'static [u64]

COFACTOR = 1

const COFACTOR_INV: Fr = Fr::ONE

COFACTOR_INV = 1

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 PallasConfig

fn default() -> PallasConfig

Returns the “default value” for a type.

impl GLVConfig for PallasConfig

const ENDO_COEFFS: &'static [Self::BaseField]

Constants that are used to calculate phi(G) := lambda*G. The coefficients of the endomorphism

const LAMBDA: Self::ScalarField

The eigenvalue corresponding to the endomorphism.

const SCALAR_DECOMP_COEFFS: [(bool, <Self::ScalarField as PrimeField>::BigInt); 4]

A 4-element vector representing a 2x2 matrix of coefficients the for scalar decomposition, s.t. k-th entry in the vector is at col i, row j in the matrix, with ij = BE binary decomposition of k. The entries are the LLL-reduced bases. The determinant of this matrix must equal ScalarField::characteristic().

fn endomorphism(p: &Projective) -> Projective

fn endomorphism_affine(p: &Affine) -> Affine

fn scalar_decomposition( k: Self::ScalarField, ) -> ((bool, Self::ScalarField), (bool, Self::ScalarField))

Decomposes a scalar s into k1, k2, s.t. s = k1 + lambda k2,

fn glv_mul_projective( p: Projective<Self>, k: Self::ScalarField, ) -> Projective<Self>

fn glv_mul_affine(p: Affine<Self>, k: Self::ScalarField) -> Affine<Self>

impl PartialEq for PallasConfig

fn eq(&self, other: &PallasConfig) -> 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 SWCurveConfig for PallasConfig

const COEFF_A: Fq = Fq::ZERO

COEFF_A = 0

const COEFF_B: Fq

COEFF_B = 5

const GENERATOR: Affine

AFFINE_GENERATOR_COEFFS = (G1_GENERATOR_X, G1_GENERATOR_Y)

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

Helper method for computing elem * Self::COEFF_A.

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

Helper method for computing elem + Self::COEFF_B.

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

Check if the provided curve point is in the prime-order subgroup.

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

Performs cofactor clearing. The default method is simply to multiply by the cofactor. Some curves can implement a more efficient algorithm.

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 as well as a bit for whether it is infinity. If compressed, serializes x coordinate with two bits to encode whether y is positive, negative, or infinity.

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 Copy for PallasConfig

impl Eq for PallasConfig

impl StructuralPartialEq for PallasConfig