a portable and fast pairing-based cryptography library
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.
mcl/test/ec_test.cpp

351 lines
6.0 KiB

10 years ago
#define PUT(x) std::cout << #x "=" << (x) << std::endl
#define CYBOZU_TEST_DISABLE_AUTO_RUN
#include <cybozu/test.hpp>
#include <cybozu/benchmark.hpp>
#include <mcl/gmp_util.hpp>
#include <mcl/fp.hpp>
#include <mcl/ec.hpp>
#include <mcl/ecparam.hpp>
#include <time.h>
typedef mcl::FpT<> Fp;
10 years ago
struct tagZn;
typedef mcl::FpT<tagZn> Zn;
typedef mcl::EcT<Fp> Ec;
10 years ago
struct Test {
const mcl::EcParam& para;
Test(const mcl::EcParam& para)
: para(para)
{
Fp::setModulo(para.p);
Zn::setModulo(para.n);
Ec::setParam(para.a, para.b);
}
void cstr() const
{
Ec O;
CYBOZU_TEST_ASSERT(O.isZero());
Ec P;
Ec::neg(P, O);
CYBOZU_TEST_EQUAL(P, O);
}
void pow2(Ec& Q, const Ec& P, int n) const
{
Q = P;
for (int i = 0; i < n; i++) {
Q += Q;
}
}
void pow2test(const Ec& P, int n) const
{
Ec Q, R;
pow2(Q, P, n);
Q -= P; // Q = (2^n - 1)P
Fp x = 1;
for (int i = 0; i < n; i++) {
x += x;
}
x -= 1; // x = 2^n - 1
Ec::mul(R, P, x);
CYBOZU_TEST_EQUAL(Q, R);
Q = P;
Ec::mul(Q, Q, x);
CYBOZU_TEST_EQUAL(Q, R);
}
10 years ago
void ope() const
{
Fp x(para.gx);
Fp y(para.gy);
Zn n = 0;
CYBOZU_TEST_ASSERT(Ec::isValid(x, y));
Ec P(x, y), Q, R, O;
{
Ec::neg(Q, P);
CYBOZU_TEST_EQUAL(Q.x, P.x);
CYBOZU_TEST_EQUAL(Q.y, -P.y);
R = P + Q;
CYBOZU_TEST_ASSERT(R.isZero());
R = P + O;
CYBOZU_TEST_EQUAL(R, P);
R = O + P;
CYBOZU_TEST_EQUAL(R, P);
}
{
Ec::dbl(R, P);
Ec R2 = P + P;
CYBOZU_TEST_EQUAL(R, R2);
{
Ec P2 = P;
Ec::dbl(P2, P2);
CYBOZU_TEST_EQUAL(P2, R2);
}
Ec R3L = R2 + P;
Ec R3R = P + R2;
CYBOZU_TEST_EQUAL(R3L, R3R);
{
Ec RR = R2;
RR = RR + P;
CYBOZU_TEST_EQUAL(RR, R3L);
RR = R2;
RR = P + RR;
CYBOZU_TEST_EQUAL(RR, R3L);
RR = P;
RR = RR + RR;
CYBOZU_TEST_EQUAL(RR, R2);
}
Ec::mul(R, P, 2);
10 years ago
CYBOZU_TEST_EQUAL(R, R2);
Ec R4L = R3L + R2;
Ec R4R = R2 + R3L;
CYBOZU_TEST_EQUAL(R4L, R4R);
Ec::mul(R, P, 5);
10 years ago
CYBOZU_TEST_EQUAL(R, R4L);
}
{
R = P;
for (int i = 0; i < 10; i++) {
R += P;
}
Ec R2;
Ec::mul(R2, P, 11);
10 years ago
CYBOZU_TEST_EQUAL(R, R2);
}
Ec::mul(R, P, n - 1);
10 years ago
CYBOZU_TEST_EQUAL(R, -P);
R += P; // Ec::mul(R, P, n);
10 years ago
CYBOZU_TEST_ASSERT(R.isZero());
{
const int tbl[] = { 1, 2, 63, 64, 65, 127, 128, 129 };
for (size_t i = 0; i < CYBOZU_NUM_OF_ARRAY(tbl); i++) {
pow2test(P, tbl[i]);
}
}
{
Ec::mul(Q, P, 0);
CYBOZU_TEST_ASSERT(Q.isZero());
Q = P;
CYBOZU_TEST_ASSERT(!Q.isZero());
Ec::mul(Q, Q, 0);
CYBOZU_TEST_ASSERT(Q.isZero());
Ec::mul(Q, P, 1);
CYBOZU_TEST_EQUAL(P, Q);
}
10 years ago
}
void mul() const
10 years ago
{
Fp x(para.gx);
Fp y(para.gy);
Ec P(x, y);
Ec Q;
Ec R;
for (int i = 0; i < 100; i++) {
Ec::mul(Q, P, i);
10 years ago
CYBOZU_TEST_EQUAL(Q, R);
R += P;
}
}
void neg_mul() const
10 years ago
{
Fp x(para.gx);
Fp y(para.gy);
Ec P(x, y);
Ec Q;
Ec R;
for (int i = 0; i < 100; i++) {
Ec::mul(Q, P, -i);
10 years ago
CYBOZU_TEST_EQUAL(Q, R);
R -= P;
}
}
void squareRoot() const
{
Fp x(para.gx);
Fp y(para.gy);
bool odd = Fp::isOdd(y);
10 years ago
Fp yy;
Ec::getYfromX(yy, x, odd);
CYBOZU_TEST_EQUAL(yy, y);
Fp::neg(y, y);
odd = Fp::isOdd(y);
10 years ago
yy.clear();
Ec::getYfromX(yy, x, odd);
CYBOZU_TEST_EQUAL(yy, y);
}
void mul_fp() const
10 years ago
{
Fp x(para.gx);
Fp y(para.gy);
Ec P(x, y);
Ec Q;
Ec R;
for (int i = 0; i < 100; i++) {
Ec::mul(Q, P, Zn(i));
10 years ago
CYBOZU_TEST_EQUAL(Q, R);
R += P;
}
}
void str() const
{
puts("test str");
const Fp x(para.gx);
const Fp y(para.gy);
Ec P(x, y);
Ec Q;
// not compressed
Ec::setCompressedExpression(false);
{
std::stringstream ss;
ss << P;
ss >> Q;
CYBOZU_TEST_EQUAL(P, Q);
}
{
P = -P;
std::stringstream ss;
ss << P;
ss >> Q;
CYBOZU_TEST_EQUAL(P, Q);
}
P.clear();
{
std::stringstream ss;
ss << P;
ss >> Q;
CYBOZU_TEST_EQUAL(P, Q);
}
// compressed
Ec::setCompressedExpression(true);
P.set(x, y);
{
std::stringstream ss;
ss << P;
ss >> Q;
CYBOZU_TEST_EQUAL(P, Q);
}
{
P = -P;
std::stringstream ss;
ss << P;
ss >> Q;
CYBOZU_TEST_EQUAL(P, Q);
}
P.clear();
{
std::stringstream ss;
ss << P;
ss >> Q;
CYBOZU_TEST_EQUAL(P, Q);
}
}
template<class F>
void test(F f, const char *msg) const
{
const int N = 300000;
Fp x(para.gx);
Fp y(para.gy);
Ec P(x, y);
Ec Q = P + P + P;
clock_t begin = clock();
for (int i = 0; i < N; i++) {
f(Q, P, Q);
}
clock_t end = clock();
printf("%s %.2fusec\n", msg, (end - begin) / double(CLOCKS_PER_SEC) / N * 1e6);
}
/*
Affine : sandy-bridge
add 3.17usec
sub 2.43usec
dbl 3.32usec
mul 905.00usec
10 years ago
Jacobi
add 2.34usec
sub 2.65usec
dbl 1.56usec
mul 499.00usec
10 years ago
*/
void run() const
{
cstr();
ope();
mul();
neg_mul();
mul_fp();
10 years ago
squareRoot();
str();
}
private:
Test(const Test&);
void operator=(const Test&);
};
void test_sub(const mcl::EcParam *para, size_t paraNum)
{
for (size_t i = 0; i < paraNum; i++) {
puts(para[i].name);
Test(para[i]).run();
10 years ago
}
}
int g_partial = -1;
CYBOZU_TEST_AUTO(all)
{
if (g_partial & (1 << 3)) {
const struct mcl::EcParam para3[] = {
// mcl::ecparam::p160_1,
mcl::ecparam::secp160k1,
mcl::ecparam::secp192k1,
mcl::ecparam::NIST_P192,
};
test_sub(para3, CYBOZU_NUM_OF_ARRAY(para3));
10 years ago
}
if (g_partial & (1 << 4)) {
const struct mcl::EcParam para4[] = {
mcl::ecparam::secp224k1,
mcl::ecparam::secp256k1,
mcl::ecparam::NIST_P224,
mcl::ecparam::NIST_P256,
};
test_sub(para4, CYBOZU_NUM_OF_ARRAY(para4));
10 years ago
}
if (g_partial & (1 << 6)) {
const struct mcl::EcParam para6[] = {
// mcl::ecparam::secp384r1,
mcl::ecparam::NIST_P384,
};
test_sub(para6, CYBOZU_NUM_OF_ARRAY(para6));
10 years ago
}
if (g_partial & (1 << 9)) {
const struct mcl::EcParam para9[] = {
// mcl::ecparam::secp521r1,
mcl::ecparam::NIST_P521,
};
test_sub(para9, CYBOZU_NUM_OF_ARRAY(para9));
10 years ago
}
}
int main(int argc, char *argv[])
{
if (argc == 1) {
g_partial = -1;
} else {
g_partial = 0;
for (int i = 1; i < argc; i++) {
g_partial |= 1 << atoi(argv[i]);
}
}
return cybozu::test::autoRun.run(argc, argv);
}