add Straus multiexp

tests/performance_tests/CMakeLists.txt

@@ -45,6 +45,7 @@ set(performance_tests_headers
   range_proof.h
   bulletproof.h
   crypto_ops.h
+  multiexp.h
   multi_tx_test_base.h
   performance_tests.h
   performance_utils.h

tests/performance_tests/main.cpp

@@ -56,6 +56,7 @@
 #include "rct_mlsag.h"
 #include "bulletproof.h"
 #include "crypto_ops.h"
+#include "multiexp.h"
 
 namespace po = boost::program_options;
 
@@ -196,6 +197,20 @@ int main(int argc, char** argv)
   TEST_PERFORMANCE1(filter, test_crypto_ops, op_addKeys3);
   TEST_PERFORMANCE1(filter, test_crypto_ops, op_addKeys3_2);
 
+  TEST_PERFORMANCE2(filter, verbose, test_multiexp, multiexp_bos_coster, 2);
+  TEST_PERFORMANCE2(filter, verbose, test_multiexp, multiexp_bos_coster, 8);
+  TEST_PERFORMANCE2(filter, verbose, test_multiexp, multiexp_bos_coster, 16);
+  TEST_PERFORMANCE2(filter, verbose, test_multiexp, multiexp_bos_coster, 256);
+  TEST_PERFORMANCE2(filter, verbose, test_multiexp, multiexp_bos_coster, 1024);
+  TEST_PERFORMANCE2(filter, verbose, test_multiexp, multiexp_bos_coster, 4096);
+
+  TEST_PERFORMANCE2(filter, verbose, test_multiexp, multiexp_straus, 2);
+  TEST_PERFORMANCE2(filter, verbose, test_multiexp, multiexp_straus, 8);
+  TEST_PERFORMANCE2(filter, verbose, test_multiexp, multiexp_straus, 16);
+  TEST_PERFORMANCE2(filter, verbose, test_multiexp, multiexp_straus, 256);
+  TEST_PERFORMANCE2(filter, verbose, test_multiexp, multiexp_straus, 1024);
+  TEST_PERFORMANCE2(filter, verbose, test_multiexp, multiexp_straus, 4096);
+
   std::cout << "Tests finished. Elapsed time: " << timer.elapsed_ms() / 1000 << " sec" << std::endl;
 
   return 0;

tests/performance_tests/multiexp.h

@@ -0,0 +1,81 @@
+// Copyright (c) 2018, The Monero Project
+// 
+// All rights reserved.
+// 
+// Redistribution and use in source and binary forms, with or without modification, are
+// permitted provided that the following conditions are met:
+// 
+// 1. Redistributions of source code must retain the above copyright notice, this list of
+//    conditions and the following disclaimer.
+// 
+// 2. Redistributions in binary form must reproduce the above copyright notice, this list
+//    of conditions and the following disclaimer in the documentation and/or other
+//    materials provided with the distribution.
+// 
+// 3. Neither the name of the copyright holder nor the names of its contributors may be
+//    used to endorse or promote products derived from this software without specific
+//    prior written permission.
+// 
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
+// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+// MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
+// THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
+// STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+// THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+// 
+// Parts of this file are originally copyright (c) 2012-2013 The Cryptonote developers
+
+#pragma once
+
+#include <vector>
+#include "ringct/rctOps.h"
+#include "ringct/multiexp.h"
+
+enum test_multiexp_algorithm
+{
+  multiexp_bos_coster,
+  multiexp_straus,
+};
+
+template<test_multiexp_algorithm algorithm, size_t npoints>
+class test_multiexp
+{
+public:
+  static const size_t loop_count = npoints >= 1024 ? 10 : npoints < 256 ? 1000 : 100;
+
+  bool init()
+  {
+    data.resize(npoints);
+    res = rct::identity();
+    for (size_t n = 0; n < npoints; ++n)
+    {
+      data[n].scalar = rct::skGen();
+      rct::key point = rct::scalarmultBase(rct::skGen());
+      if (ge_frombytes_vartime(&data[n].point, point.bytes))
+        return false;
+      rct::key kn = rct::scalarmultKey(point, data[n].scalar);
+      res = rct::addKeys(res, kn);
+    }
+    return true;
+  }
+
+  bool test()
+  {
+    switch (algorithm)
+    {
+      case multiexp_bos_coster:
+        return res == bos_coster_heap_conv_robust(data);
+      case multiexp_straus:
+        return res == straus(data, false);
+      default:
+        return false;
+    }
+  }
+
+private:
+  std::vector<rct::MultiexpData> data;
+  rct::key res;
+};