Struct Config

pub struct Config;

Trait Implementations

impl Clone for Config

fn clone(&self) -> Config

Returns a copy of the value.

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

Performs copy-assignment from source.

impl CurveConfig for Config

const COFACTOR: &'static [u64] = _

COFACTOR = (x - 1)^2 / 3 = 30631250834960419227450344600217059328

const COFACTOR_INV: Fr = _

COFACTOR_INV = COFACTOR^{-1} mod r = 5285428838741532253824584287042945485047145357130994810877

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

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 Config

fn default() -> Config

Returns the “default value” for a type.

impl GLVConfig for Config

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: &SWProjective<Self>) -> SWProjective<Self>

fn endomorphism_affine(p: &SWAffine<Self>) -> SWAffine<Self>

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 MontCurveConfig for Config

const COEFF_A: Fq = _

COEFF_A = 228097355113300204138531148905234651262148041026195375645000724271212049151994375092458297304264351187709081232384

const COEFF_B: Fq = _

COEFF_B = 10189023633222963290707194929886294091415157242906428298294512798502806398782149227503530278436336312243746741931

type TECurveConfig = Config

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

impl PartialEq for Config

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

const COEFF_A: Fq = Fq::ZERO

COEFF_A = 0

const COEFF_B: Fq = Fq::ONE

COEFF_B = 1

const GENERATOR: G1SWAffine = _

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 mul_projective(p: &G1Projective, scalar: &[u64]) -> G1Projective

Default implementation of group multiplication for projective coordinates

fn clear_cofactor(p: &G1SWAffine) -> G1SWAffine

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

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 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 TECurveConfig for Config

Bls12_377::G1 also has a twisted Edwards form. It can be obtained via the following script, implementing

1. SW -> Montgomery -> TE1 transformation: https://en.wikipedia.org/wiki/Montgomery_curve
2. TE1 -> TE2 normalization (enforcing a = -1)

# modulus
p = 0x1ae3a4617c510eac63b05c06ca1493b1a22d9f300f5138f1ef3622fba094800170b5d44300000008508c00000000001
Fp = Zmod(p)

#####################################################
# Weierstrass curve: y² = x³ + A * x + B
#####################################################
# curve y^2 = x^3 + 1
WA = Fp(0)
WB = Fp(1)

#####################################################
# Montgomery curve: By² = x³ + A * x² + x
#####################################################
# root for x^3 + 1 = 0
alpha = -1
# s = 1 / (sqrt(3alpha^2 + a))
s = 1/(Fp(3).sqrt())

# MA = 3 * alpha * s
MA = Fp(228097355113300204138531148905234651262148041026195375645000724271212049151994375092458297304264351187709081232384)
# MB = s
MB = Fp(10189023633222963290707194929886294091415157242906428298294512798502806398782149227503530278436336312243746741931)

# #####################################################
# # Twisted Edwards curve 1: a * x² + y² = 1 + d * x² * y²
# #####################################################
# We first convert to TE form obtaining a curve with a != -1, and then
# apply a transformation to obtain a TE curve with a = -1.
# a = (MA+2)/MB
TE1a = Fp(61134141799337779744243169579317764548490943457438569789767076791016838392692895365021181670618017873462480451583)
# b = (MA-2)/MB
TE1d = Fp(197530284213631314266409564115575768987902569297476090750117185875703629955647927409947706468955342250977841006588)

# #####################################################
# # Twisted Edwards curve 2: a * x² + y² = 1 + d * x² * y²
# #####################################################
# a = -1
TE2a = Fp(-1)
# b = -TE1d/TE1a
TE2d = Fp(122268283598675559488486339158635529096981886914877139579534153582033676785385790730042363341236035746924960903179)

const COEFF_A: Fq = _

COEFF_A = -1

const COEFF_D: Fq = _

COEFF_D = 122268283598675559488486339158635529096981886914877139579534153582033676785385790730042363341236035746924960903179 mod q

const GENERATOR: G1TEAffine = _

AFFINE_GENERATOR_COEFFS = (GENERATOR_X, GENERATOR_Y)

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

Multiplication by a is multiply by -1.

type MontCurveConfig = Config

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 WBConfig for Config

const ISOGENY_MAP: IsogenyMap<'static, Self::IsogenousCurve, Self> = ISOGENY_MAP_TO_G1

type IsogenousCurve = SwuIsoConfig

impl Eq for Config

impl StructuralPartialEq for Config