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.
120 lines
2.8 KiB
120 lines
2.8 KiB
#define PUT(x) std::cout << #x << "=" << (x) << std::endl;
|
|
#include <cybozu/test.hpp>
|
|
#include <cybozu/benchmark.hpp>
|
|
#include <cybozu/random_generator.hpp>
|
|
#include <mcl/bn256.hpp>
|
|
#include <mcl/bgn.hpp>
|
|
|
|
cybozu::RandomGenerator rg;
|
|
|
|
typedef mcl::bgn::BGNT<mcl::bn256::BN, mcl::bn256::Fr> BGN;
|
|
typedef BGN::SecretKey SecretKey;
|
|
typedef BGN::PublicKey PublicKey;
|
|
typedef BGN::CipherText CipherText;
|
|
|
|
using namespace mcl::bgn;
|
|
using namespace mcl::bn256;
|
|
|
|
SecretKey g_sec;
|
|
|
|
CYBOZU_TEST_AUTO(log)
|
|
{
|
|
BGN::init();
|
|
G1 P;
|
|
BN::hashAndMapToG1(P, "abc");
|
|
for (int i = -5; i < 5; i++) {
|
|
G1 iP;
|
|
G1::mul(iP, P, i);
|
|
CYBOZU_TEST_EQUAL(mcl::bgn::local::log(P, iP), i);
|
|
}
|
|
}
|
|
|
|
CYBOZU_TEST_AUTO(EcHashTable)
|
|
{
|
|
mcl::bgn::local::EcHashTable<G1> hashTbl;
|
|
G1 P;
|
|
BN::hashAndMapToG1(P, "abc");
|
|
const int maxSize = 10;
|
|
const int tryNum = 3;
|
|
hashTbl.init(P, maxSize, tryNum);
|
|
for (int i = -maxSize; i <= maxSize; i++) {
|
|
G1 xP;
|
|
G1::mul(xP, P, i);
|
|
CYBOZU_TEST_EQUAL(hashTbl.basicLog(xP), i);
|
|
}
|
|
for (int i = -maxSize * tryNum; i <= maxSize * tryNum; i++) {
|
|
G1 xP;
|
|
G1::mul(xP, P, i);
|
|
CYBOZU_TEST_EQUAL(hashTbl.log(xP), i);
|
|
}
|
|
}
|
|
|
|
CYBOZU_TEST_AUTO(enc_dec)
|
|
{
|
|
SecretKey& sec = g_sec;
|
|
sec.setByCSPRNG(rg);
|
|
sec.setDecodeRange(1024);
|
|
PublicKey pub;
|
|
sec.getPublicKey(pub);
|
|
CipherText c;
|
|
for (int i = -5; i < 5; i++) {
|
|
pub.enc(c, i, rg);
|
|
CYBOZU_TEST_EQUAL(sec.dec(c), i);
|
|
pub.rerandomize(c, rg);
|
|
CYBOZU_TEST_EQUAL(sec.dec(c), i);
|
|
}
|
|
}
|
|
|
|
CYBOZU_TEST_AUTO(add_mul)
|
|
{
|
|
const SecretKey& sec = g_sec;
|
|
PublicKey pub;
|
|
sec.getPublicKey(pub);
|
|
for (int m1 = -5; m1 < 5; m1++) {
|
|
for (int m2 = -5; m2 < 5; m2++) {
|
|
CipherText c1, c2, c3;
|
|
pub.enc(c1, m1, rg);
|
|
pub.enc(c2, m2, rg);
|
|
CipherText::add(c3, c1, c2);
|
|
CYBOZU_TEST_EQUAL(m1 + m2, sec.dec(c3));
|
|
pub.rerandomize(c3, rg);
|
|
CYBOZU_TEST_EQUAL(m1 + m2, sec.dec(c3));
|
|
CipherText::mul(c3, c1, c2);
|
|
CYBOZU_TEST_EQUAL(m1 * m2, sec.dec(c3));
|
|
pub.rerandomize(c3, rg);
|
|
CYBOZU_TEST_EQUAL(m1 * m2, sec.dec(c3));
|
|
}
|
|
}
|
|
}
|
|
|
|
CYBOZU_TEST_AUTO(add_mul_add)
|
|
{
|
|
const SecretKey& sec = g_sec;
|
|
PublicKey pub;
|
|
sec.getPublicKey(pub);
|
|
int m[8] = { 1, -2, 3, 4, -5, 6, -7, 8 };
|
|
CipherText c[8];
|
|
for (int i = 0; i < 8; i++) {
|
|
pub.enc(c[i], m[i], rg);
|
|
CYBOZU_TEST_EQUAL(sec.dec(c[i]), m[i]);
|
|
CYBOZU_TEST_ASSERT(!c[i].isMultiplied());
|
|
CipherText mc;
|
|
pub.mulEnc1(mc, c[i], rg);
|
|
CYBOZU_TEST_ASSERT(mc.isMultiplied());
|
|
CYBOZU_TEST_EQUAL(sec.dec(mc), m[i]);
|
|
}
|
|
int ok1 = (m[0] + m[1]) * (m[2] + m[3]);
|
|
int ok2 = (m[4] + m[5]) * (m[6] + m[7]);
|
|
int ok = ok1 + ok2;
|
|
for (int i = 0; i < 4; i++) {
|
|
c[i * 2].add(c[i * 2 + 1]);
|
|
CYBOZU_TEST_EQUAL(sec.dec(c[i * 2]), m[i * 2] + m[i * 2 + 1]);
|
|
}
|
|
c[0].mul(c[2]);
|
|
CYBOZU_TEST_EQUAL(sec.dec(c[0]), ok1);
|
|
c[4].mul(c[6]);
|
|
CYBOZU_TEST_EQUAL(sec.dec(c[4]), ok2);
|
|
c[0].add(c[4]);
|
|
CYBOZU_TEST_EQUAL(sec.dec(c[0]), ok);
|
|
}
|
|
|
|
|