Struct Naive

pub struct Naive;

Naive algorithm

Computes multiscalar multiplication naively, by calculating each $s_i P_i$ separately, and $\sum$-ing them.

Complexity:

$$\text{cost} = \log_2 s \cdot D + \frac{1}{2} \log_2 s \cdot A$$

Trait Implementations

impl<E: Curve> MultiscalarMul<E> for Naive

fn multiscalar_mul<S, P>( scalar_points: impl IntoIterator<Item = (S, P)>, ) -> Point<E>

where S: AsRef<Scalar<E>>, P: AsRef<Point<E>>,

Performs multiscalar multiplication