Trait MultiscalarMul

Source

pub trait MultiscalarMul<E: Curve> {
    // Required method
    fn multiscalar_mul<S, P>(
        scalar_points: impl ExactSizeIterator<Item = (S, P)>,
    ) -> Point<E>
       where S: AsRef<Scalar<E>>,
             P: AsRef<Point<E>>;
}

Expand description

Multiscalar multiplication algorithm

See module-level docs for motivation and list of provided algorithms.

Required Methods§

Source

fn multiscalar_mul<S, P>( scalar_points: impl ExactSizeIterator<Item = (S, P)>, ) -> Point<E>
where S: AsRef<Scalar<E>>, P: AsRef<Point<E>>,

Performs multiscalar multiplication

Takes iterator of pairs (scalar, point). Returns sum of scalar * point. Iterator must have exact size (i.e. it’s ExactSizeIterator). Iterator size is used to determine the best algorithm for multiscalar multiplication, preallocate memory, etc. If iterator size is not correct, it may worsen performance or lead to runtime panic.

Note that the multiscalar algorithm is not necessarily constant-time, thus is should not be used with SecretScalar<E>.