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/sample/pairing_c.c

58 lines
1.4 KiB

#include <stdio.h>
#include <string.h>
#include <mcl/bn_c384_256.h>
int g_err = 0;
#define ASSERT(x) { if (!(x)) { printf("err %s:%d\n", __FILE__, __LINE__); g_err++; } }
int main()
{
char buf[1600];
const char *aStr = "123";
const char *bStr = "456";
int ret = mclBn_init(MCL_BLS12_381, MCLBN_COMPILED_TIME_VAR);
if (ret != 0) {
printf("err ret=%d\n", ret);
return 1;
}
mclBnFr a, b, ab;
mclBnG1 P, aP;
mclBnG2 Q, bQ;
mclBnGT e, e1, e2;
mclBnFr_setStr(&a, aStr, strlen(aStr), 10);
mclBnFr_setStr(&b, bStr, strlen(bStr), 10);
mclBnFr_mul(&ab, &a, &b);
mclBnFr_getStr(buf, sizeof(buf), &ab, 10);
printf("%s x %s = %s\n", aStr, bStr, buf);
mclBnFr_sub(&a, &a, &b);
mclBnFr_getStr(buf, sizeof(buf), &a, 10);
printf("%s - %s = %s\n", aStr, bStr, buf);
ASSERT(!mclBnG1_hashAndMapTo(&P, "this", 4));
ASSERT(!mclBnG2_hashAndMapTo(&Q, "that", 4));
ASSERT(mclBnG1_getStr(buf, sizeof(buf), &P, 16));
printf("P = %s\n", buf);
ASSERT(mclBnG2_getStr(buf, sizeof(buf), &Q, 16));
printf("Q = %s\n", buf);
mclBnG1_mul(&aP, &P, &a);
mclBnG2_mul(&bQ, &Q, &b);
mclBn_pairing(&e, &P, &Q);
ASSERT(mclBnGT_getStr(buf, sizeof(buf), &e, 16));
printf("e = %s\n", buf);
mclBnGT_pow(&e1, &e, &a);
mclBn_pairing(&e2, &aP, &Q);
ASSERT(mclBnGT_isEqual(&e1, &e2));
mclBnGT_pow(&e1, &e, &b);
mclBn_pairing(&e2, &P, &bQ);
ASSERT(mclBnGT_isEqual(&e1, &e2));
if (g_err) {
printf("err %d\n", g_err);
return 1;
} else {
printf("no err\n");
return 0;
}
}