Struct curve25519_dalek::backend::vector::scalar_mul::precomputed_straus::VartimePrecomputedStraus

pub struct VartimePrecomputedStraus {
    static_lookup_tables: Vec<NafLookupTable8<CachedPoint>>,
}

This is supported on crate feature simd_backend and (target features avx2 or avx512ifma) only.

Fields

static_lookup_tables: Vec<NafLookupTable8<CachedPoint>>

Trait Implementations

impl VartimePrecomputedMultiscalarMul for VartimePrecomputedStraus

type Point = EdwardsPoint

The type of point to be multiplied, e.g., RistrettoPoint.

fn new<I>(static_points: I) -> Self where
    I: IntoIterator,
    I::Item: Borrow<Self::Point>, 

Given the static points \( B_i \), perform precomputation and return the precomputation data.

fn optional_mixed_multiscalar_mul<I, J, K>(
    &self,
    static_scalars: I,
    dynamic_scalars: J,
    dynamic_points: K
) -> Option<Self::Point> where
    I: IntoIterator,
    I::Item: Borrow<Scalar>,
    J: IntoIterator,
    J::Item: Borrow<Scalar>,
    K: IntoIterator<Item = Option<Self::Point>>, 

Given static_scalars, an iterator of public scalars \(b_i\), dynamic_scalars, an iterator of public scalars \(a_i\), and dynamic_points, an iterator of points \(A_i\), compute $$ Q = a_1 A_1 + \cdots + a_n A_n + b_1 B_1 + \cdots + b_m B_m, $$ where the \(B_j\) are the points that were supplied to new.

fn vartime_multiscalar_mul<I>(&self, static_scalars: I) -> Self::Point where
    I: IntoIterator,
    I::Item: Borrow<Scalar>, 

Given static_scalars, an iterator of public scalars \(b_i\), compute $$ Q = b_1 B_1 + \cdots + b_m B_m, $$ where the \(B_j\) are the points that were supplied to new.

fn vartime_mixed_multiscalar_mul<I, J, K>(
    &self,
    static_scalars: I,
    dynamic_scalars: J,
    dynamic_points: K
) -> Self::Point where
    I: IntoIterator,
    I::Item: Borrow<Scalar>,
    J: IntoIterator,
    J::Item: Borrow<Scalar>,
    K: IntoIterator,
    K::Item: Borrow<Self::Point>, 

Given static_scalars, an iterator of public scalars \(b_i\), dynamic_scalars, an iterator of public scalars \(a_i\), and dynamic_points, an iterator of points \(A_i\), compute $$ Q = a_1 A_1 + \cdots + a_n A_n + b_1 B_1 + \cdots + b_m B_m, $$ where the \(B_j\) are the points that were supplied to new.