Type Alias Point

pub type Point = Ep;

A Pallas point in the projective coordinate space.

Aliased Type

struct Point { /* private fields */ }

Implementations

impl Ep

pub const ISOGENY_CONSTANTS: [Fp; 13]

Constants used for computing the isogeny from IsoEp to Ep.

pub const Z: Fp

Z = -13

pub const THETA: Fp

(F::ROOT_OF_UNITY.invert().unwrap() * z).sqrt().unwrap()

Trait Implementations

impl<'b> Add<&'b Ep> for Ep

type Output = Ep

The resulting type after applying the + operator.

fn add(self, rhs: &'b Ep) -> Ep

Performs the + operation.

impl<'b> Add<&'b EpAffine> for Ep

type Output = Ep

The resulting type after applying the + operator.

fn add(self, rhs: &'b EpAffine) -> Ep

Performs the + operation.

impl Add<EpAffine> for Ep

type Output = Ep

The resulting type after applying the + operator.

fn add(self, rhs: EpAffine) -> Ep

Performs the + operation.

impl Add for Ep

type Output = Ep

The resulting type after applying the + operator.

fn add(self, rhs: Ep) -> Ep

Performs the + operation.

impl<'b> AddAssign<&'b Ep> for Ep

fn add_assign(&mut self, rhs: &'b Ep)

Performs the += operation.

impl<'b> AddAssign<&'b EpAffine> for Ep

fn add_assign(&mut self, rhs: &'b EpAffine)

Performs the += operation.

impl AddAssign<EpAffine> for Ep

fn add_assign(&mut self, rhs: EpAffine)

Performs the += operation.

impl AddAssign for Ep

fn add_assign(&mut self, rhs: Ep)

Performs the += operation.

impl Clone for Ep

fn clone(&self) -> Ep

Returns a copy of the value.

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

Performs copy-assignment from source.

impl CofactorCurve for Ep

type Affine = EpAffine

impl CofactorGroup for Ep

type Subgroup = Ep

The large prime-order subgroup in which cryptographic operations are performed. If Self implements PrimeGroup, then Self::Subgroup may be Self.

fn clear_cofactor(&self) -> Ep

Maps self to the prime-order subgroup by multiplying this element by some k-multiple of the cofactor.

fn into_subgroup(self) -> CtOption<<Ep as CofactorGroup>::Subgroup>

Returns self if it is contained in the prime-order subgroup.

fn is_torsion_free(&self) -> Choice

Determines if this element is “torsion free”, i.e., is contained in the prime-order subgroup.

fn is_small_order(&self) -> Choice

Determines if this element is of small order.

impl ConditionallySelectable for Ep

fn conditional_select(a: &Ep, b: &Ep, choice: Choice) -> Ep

Select a or b according to choice.

fn conditional_assign(&mut self, other: &Self, choice: Choice)

Conditionally assign other to self, according to choice.

fn conditional_swap(a: &mut Self, b: &mut Self, choice: Choice)

Conditionally swap self and other if choice == 1; otherwise, reassign both unto themselves.

impl ConstantTimeEq for Ep

fn ct_eq(&self, other: &Ep) -> Choice

Determine if two items are equal.

fn ct_ne(&self, other: &Self) -> Choice

Determine if two items are NOT equal.

impl Curve for Ep

type AffineRepr = EpAffine

The affine representation for this elliptic curve.

fn batch_normalize(p: &[Ep], q: &mut [<Ep as Curve>::AffineRepr])

Converts a batch of projective elements into affine elements. This function will panic if p.len() != q.len().

fn to_affine(&self) -> <Ep as Curve>::AffineRepr

Converts this element into its affine representation.

impl CurveExt for Ep

fn endo(&self) -> Ep

Apply the curve endomorphism by multiplying the x-coordinate by an element of multiplicative order 3.

const CURVE_ID: &'static str = "pallas"

CURVE_ID used for hash-to-curve.

type ScalarExt = Fq

The scalar field of this elliptic curve.

type Base = Fp

The base field over which this elliptic curve is constructed.

type AffineExt = EpAffine

The affine version of the curve

fn hash_to_curve<'a>(domain_prefix: &'a str) -> Box<dyn Fn(&[u8]) -> Ep + 'a>

Requests a hasher that accepts messages and returns near-uniformly distributed elements in the group, given domain prefix domain_prefix.

fn a() -> <Ep as CurveExt>::Base

Returns the curve constant a.

fn b() -> <Ep as CurveExt>::Base

Returns the curve constant b.

fn new_jacobian( x: <Ep as CurveExt>::Base, y: <Ep as CurveExt>::Base, z: <Ep as CurveExt>::Base, ) -> CtOption<Ep>

Obtains a point given Jacobian coordinates $X : Y : Z$, failing if the coordinates are not on the curve.

fn jacobian_coordinates(&self) -> (Fp, Fp, Fp)

Return the Jacobian coordinates of this point.

fn is_on_curve(&self) -> Choice

Returns whether or not this element is on the curve; should always be true unless an “unchecked” API was used.

impl Debug for Ep

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl Default for Ep

fn default() -> Ep

Returns the “default value” for a type.

impl<'a> From<&'a EpAffine> for Ep

fn from(p: &'a EpAffine) -> Ep

Converts to this type from the input type.

impl From<EpAffine> for Ep

fn from(p: EpAffine) -> Ep

Converts to this type from the input type.

impl Group for Ep

type Scalar = Fq

Scalars modulo the order of this group’s scalar field.

fn random(rng: impl RngCore) -> Ep

Returns an element chosen uniformly at random from the non-identity elements of this group.

fn generator() -> Ep

Returns a fixed generator of the prime-order subgroup.

fn double(&self) -> Ep

Doubles this element.

fn identity() -> Ep

Returns the additive identity, also known as the “neutral element”.

fn is_identity(&self) -> Choice

Determines if this point is the identity.

impl GroupEncoding for Ep

type Repr = [u8; 32]

The encoding of group elements.

fn from_bytes(bytes: &<Ep as GroupEncoding>::Repr) -> CtOption<Ep>

Attempts to deserialize a group element from its encoding.

fn from_bytes_unchecked(bytes: &<Ep as GroupEncoding>::Repr) -> CtOption<Ep>

Attempts to deserialize a group element, not checking if the element is valid.

fn to_bytes(&self) -> <Ep as GroupEncoding>::Repr

Converts this element into its byte encoding. This may or may not support encoding the identity.

impl<'b> Mul<&'b Fq> for Ep

type Output = Ep

The resulting type after applying the * operator.

fn mul(self, rhs: &'b Fq) -> Ep

Performs the * operation.

impl Mul<Fq> for Ep

type Output = Ep

The resulting type after applying the * operator.

fn mul(self, rhs: Fq) -> Ep

Performs the * operation.

impl<'b> MulAssign<&'b Fq> for Ep

fn mul_assign(&mut self, rhs: &'b Fq)

Performs the *= operation.

impl MulAssign<Fq> for Ep

fn mul_assign(&mut self, rhs: Fq)

Performs the *= operation.

impl Neg for Ep

type Output = Ep

The resulting type after applying the - operator.

fn neg(self) -> Ep

Performs the unary - operation.

impl PartialEq for Ep

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

type Affine = EpAffine

impl<'b> Sub<&'b Ep> for Ep

type Output = Ep

The resulting type after applying the - operator.

fn sub(self, rhs: &'b Ep) -> Ep

Performs the - operation.

impl<'b> Sub<&'b EpAffine> for Ep

type Output = Ep

The resulting type after applying the - operator.

fn sub(self, rhs: &'b EpAffine) -> Ep

Performs the - operation.

impl Sub<EpAffine> for Ep

type Output = Ep

The resulting type after applying the - operator.

fn sub(self, rhs: EpAffine) -> Ep

Performs the - operation.

impl Sub for Ep

type Output = Ep

The resulting type after applying the - operator.

fn sub(self, rhs: Ep) -> Ep

Performs the - operation.

impl<'b> SubAssign<&'b Ep> for Ep

fn sub_assign(&mut self, rhs: &'b Ep)

Performs the -= operation.

impl<'b> SubAssign<&'b EpAffine> for Ep

fn sub_assign(&mut self, rhs: &'b EpAffine)

Performs the -= operation.

impl SubAssign<EpAffine> for Ep

fn sub_assign(&mut self, rhs: EpAffine)

Performs the -= operation.

impl SubAssign for Ep

fn sub_assign(&mut self, rhs: Ep)

Performs the -= operation.

impl<T> Sum<T> for Ep

where T: Borrow<Ep>,

fn sum<I>(iter: I) -> Ep

where I: Iterator<Item = T>,

Takes an iterator and generates Self from the elements by “summing up” the items.

impl WnafGroup for Ep

fn recommended_wnaf_for_num_scalars(num_scalars: usize) -> usize

Recommends a wNAF window size given the number of scalars you intend to multiply a base by. Always returns a number between 2 and 22, inclusive.

impl Copy for Ep

impl Eq for Ep

impl PrimeGroup for Ep