You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
88 lines
3.0 KiB
88 lines
3.0 KiB
// Copyright (c) 2014-2022, 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 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 = 2; // single spend and commitment data
|
|
static const size_t loop_count = 1000;
|
|
|
|
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, ind, rows-1, hw::get_device("default"));
|
|
|
|
return true;
|
|
}
|
|
|
|
bool test()
|
|
{
|
|
if (ver)
|
|
MLSAG_Ver(rct::identity(), P, IIccss, rows-1);
|
|
else
|
|
MLSAG_Gen(rct::identity(), P, sk, ind, rows-1, hw::get_device("default"));
|
|
return true;
|
|
}
|
|
|
|
private:
|
|
rct::keyV sk;
|
|
rct::keyM P;
|
|
size_t ind{};
|
|
rct::mgSig IIccss;
|
|
};
|