Struct Ed25519AffinePoint

#[repr(align(4))]
pub struct Ed25519AffinePoint(pub [u32; 16]);

An affine point on the Ed25519 curve.

Tuple Fields

0: [u32; 16]

Implementations

impl Ed25519AffinePoint

pub fn identity() -> Self

Trait Implementations

impl AffinePoint<N> for Ed25519AffinePoint

const GENERATOR: [u32; 16] = _

The generator/base point for the Ed25519 curve. Reference: https://datatracker.ietf.org/doc/html/rfc7748#section-4.1

fn double(&mut self)

In Edwards curves, doubling is the same as adding a point to itself.

fn new(limbs: [u32; 16]) -> Self

Creates a new AffinePoint from the given limbs.

fn limbs_ref(&self) -> &[u32; 16]

Returns a reference to the limbs.

fn limbs_mut(&mut self) -> &mut [u32; 16]

Returns a mutable reference to the limbs. If the point is the infinity point, this will panic.

fn add_assign(&mut self, other: &Self)

Adds the given AffinePoint to self.

fn from(x: &[u8], y: &[u8]) -> Self

Creates a new AffinePoint from the given x and y coordinates.

fn from_le_bytes(bytes: &[u8]) -> Self

Creates a new AffinePoint from the given bytes in little endian.

fn to_le_bytes(&self) -> Vec<u8>

Creates a new AffinePoint from the given bytes in big endian.

fn complete_add_assign(&mut self, other: &Self)

Adds the given AffinePoint to self. Can be optionally overridden to use a different implementation of addition in multi-scalar multiplication, which is used in secp256k1 recovery.

fn mul_assign(&mut self, scalar: &[u32]) -> Result<(), MulAssignError>

Multiplies self by the given scalar.

fn multi_scalar_multiplication( a_bits_le: &[bool], a: Self, b_bits_le: &[bool], b: Self, ) -> Option<Self>

Performs multi-scalar multiplication (MSM) on slices of bit vectors and points. Note: a_bits_le and b_bits_le should be in little endian order.

impl Clone for Ed25519AffinePoint

fn clone(&self) -> Ed25519AffinePoint

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Copy for Ed25519AffinePoint