aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authormoneromooo-monero <moneromooo-monero@users.noreply.github.com>2017-12-31 18:58:45 +0000
committermoneromooo-monero <moneromooo-monero@users.noreply.github.com>2017-12-31 18:58:45 +0000
commited215d34e943204b3374fa3a8413b03a97699e90 (patch)
tree610b3389f62e76243076d644a3adc6077ebf7403
parentMerge pull request #2955 (diff)
downloadmonero-ed215d34e943204b3374fa3a8413b03a97699e90.tar.xz
performance_tests: add RingCT MLSAG gen/ver tests
-rw-r--r--tests/performance_tests/main.cpp10
-rw-r--r--tests/performance_tests/rct_mlsag.h87
2 files changed, 97 insertions, 0 deletions
diff --git a/tests/performance_tests/main.cpp b/tests/performance_tests/main.cpp
index 459eecba4..270999d6a 100644
--- a/tests/performance_tests/main.cpp
+++ b/tests/performance_tests/main.cpp
@@ -46,6 +46,7 @@
#include "is_out_to_acc.h"
#include "sc_reduce32.h"
#include "cn_fast_hash.h"
+#include "rct_mlsag.h"
int main(int argc, char** argv)
{
@@ -116,6 +117,15 @@ int main(int argc, char** argv)
TEST_PERFORMANCE1(test_cn_fast_hash, 32);
TEST_PERFORMANCE1(test_cn_fast_hash, 16384);
+ TEST_PERFORMANCE3(test_ringct_mlsag, 1, 3, false);
+ TEST_PERFORMANCE3(test_ringct_mlsag, 1, 5, false);
+ TEST_PERFORMANCE3(test_ringct_mlsag, 1, 10, false);
+ TEST_PERFORMANCE3(test_ringct_mlsag, 1, 100, false);
+ TEST_PERFORMANCE3(test_ringct_mlsag, 1, 3, true);
+ TEST_PERFORMANCE3(test_ringct_mlsag, 1, 5, true);
+ TEST_PERFORMANCE3(test_ringct_mlsag, 1, 10, true);
+ TEST_PERFORMANCE3(test_ringct_mlsag, 1, 100, true);
+
std::cout << "Tests finished. Elapsed time: " << timer.elapsed_ms() / 1000 << " sec" << std::endl;
return 0;
diff --git a/tests/performance_tests/rct_mlsag.h b/tests/performance_tests/rct_mlsag.h
new file mode 100644
index 000000000..70fb36aec
--- /dev/null
+++ b/tests/performance_tests/rct_mlsag.h
@@ -0,0 +1,87 @@
+// Copyright (c) 2014-2017, 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 "ringct/rctSigs.h"
+#include "cryptonote_basic/cryptonote_basic.h"
+
+#include "single_tx_test_base.h"
+
+template<size_t inputs, size_t ring_size, bool ver>
+class test_ringct_mlsag : public single_tx_test_base
+{
+public:
+ static const size_t cols = ring_size;
+ static const size_t rows = inputs;
+ static const size_t loop_count = 100;
+
+ bool init()
+ {
+ if (!single_tx_test_base::init())
+ return false;
+
+ rct::keyV xtmp = rct::skvGen(rows);
+ rct::keyM xm = rct::keyMInit(rows, cols);// = [[None]*N] #just used to generate test public keys
+ sk = rct::skvGen(rows);
+ P = rct::keyMInit(rows, cols);// = keyM[[None]*N] #stores the public keys;
+ ind = 2;
+ for (size_t j = 0 ; j < rows ; j++)
+ {
+ for (size_t i = 0 ; i < cols ; i++)
+ {
+ xm[i][j] = rct::skGen();
+ P[i][j] = rct::scalarmultBase(xm[i][j]);
+ }
+ }
+ for (size_t j = 0 ; j < rows ; j++)
+ {
+ sk[j] = xm[ind][j];
+ }
+ IIccss = MLSAG_Gen(rct::identity(), P, sk, NULL, NULL, ind, rows);
+
+ return true;
+ }
+
+ bool test()
+ {
+ if (ver)
+ MLSAG_Ver(rct::identity(), P, IIccss, rows);
+ else
+ MLSAG_Gen(rct::identity(), P, sk, NULL, NULL, ind, rows);
+ return true;
+ }
+
+private:
+ rct::keyV sk;
+ rct::keyM P;
+ size_t ind;
+ rct::mgSig IIccss;
+};