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.
56 lines
1.3 KiB
56 lines
1.3 KiB
#include <mcl/bn256.hpp>
|
|
|
|
using namespace mcl::bn256;
|
|
|
|
void minimum_sample(const G1& P, const G2& Q)
|
|
{
|
|
const mpz_class a = 123;
|
|
const mpz_class b = 456;
|
|
Fp12 e1, e2;
|
|
BN::pairing(e1, P, Q);
|
|
G2 aQ;
|
|
G1 bP;
|
|
G2::mul(aQ, Q, a);
|
|
G1::mul(bP, P, b);
|
|
BN::pairing(e2, bP, aQ);
|
|
Fp12::pow(e1, e1, a * b);
|
|
printf("%s\n", e1 == e2 ? "ok" : "ng");
|
|
}
|
|
|
|
void miller_and_finel_exp(const G1& P, const G2& Q)
|
|
{
|
|
Fp12 e1, e2;
|
|
BN::pairing(e1, P, Q);
|
|
|
|
BN::millerLoop(e2, P, Q);
|
|
BN::finalExp(e2, e2);
|
|
printf("%s\n", e1 == e2 ? "ok" : "ng");
|
|
}
|
|
|
|
void precomputed(const G1& P, const G2& Q)
|
|
{
|
|
Fp12 e1, e2;
|
|
BN::pairing(e1, P, Q);
|
|
std::vector<Fp6> Qcoeff;
|
|
BN::precomputeG2(Qcoeff, Q);
|
|
BN::precomputedMillerLoop(e2, P, Qcoeff);
|
|
BN::finalExp(e2, e2);
|
|
printf("%s\n", e1 == e2 ? "ok" : "ng");
|
|
}
|
|
|
|
int main()
|
|
{
|
|
const char *aa = "12723517038133731887338407189719511622662176727675373276651903807414909099441";
|
|
const char *ab = "4168783608814932154536427934509895782246573715297911553964171371032945126671";
|
|
const char *ba = "13891744915211034074451795021214165905772212241412891944830863846330766296736";
|
|
const char *bb = "7937318970632701341203597196594272556916396164729705624521405069090520231616";
|
|
|
|
initPairing();
|
|
G2 Q(Fp2(aa, ab), Fp2(ba, bb));
|
|
G1 P(-1, 1);
|
|
|
|
minimum_sample(P, Q);
|
|
miller_and_finel_exp(P, Q);
|
|
precomputed(P, Q);
|
|
}
|
|
|
|
|