From 19dcd6205387b529df66658856f22765b631fb49 Mon Sep 17 00:00:00 2001 From: Henry de Valence Date: Tue, 4 Jun 2019 13:41:43 -0700 Subject: [PATCH] Add reference to 2012/549 --- src/backend/serial/scalar_mul/pippenger.rs | 1 + 1 file changed, 1 insertion(+) diff --git a/src/backend/serial/scalar_mul/pippenger.rs b/src/backend/serial/scalar_mul/pippenger.rs index fe903e0..89ea723 100644 --- a/src/backend/serial/scalar_mul/pippenger.rs +++ b/src/backend/serial/scalar_mul/pippenger.rs @@ -58,6 +58,7 @@ use prelude::*; /// However, if `w` is too big and `n` is not too big, then `(2^w/2)*A` could dominate. /// Therefore, the optimal choice of `w` grows slowly as `n` grows. /// +/// This algorithm is adapted from section 4 of https://eprint.iacr.org/2012/549.pdf. pub struct Pippenger; #[cfg(any(feature = "alloc", feature = "std"))]