| #ifndef PAIR256_ZZZ_H |
| #define PAIR256_ZZZ_H |
| |
| #include "fp48_YYY.h" |
| #include "ecp8_ZZZ.h" |
| #include "ecp_ZZZ.h" |
| |
| using namespace amcl; |
| |
| namespace ZZZ { |
| /* Pairing constants */ |
| |
| extern const XXX::BIG CURVE_Bnx; /**< BN curve x parameter */ |
| extern const XXX::BIG CURVE_Cru; /**< BN curve Cube Root of Unity */ |
| |
| extern const XXX::BIG CURVE_W[2]; /**< BN curve constant for GLV decomposition */ |
| extern const XXX::BIG CURVE_SB[2][2]; /**< BN curve constant for GLV decomposition */ |
| extern const XXX::BIG CURVE_WB[4]; /**< BN curve constant for GS decomposition */ |
| extern const XXX::BIG CURVE_BB[4][4]; /**< BN curve constant for GS decomposition */ |
| |
| /* Pairing function prototypes */ |
| /** @brief Calculate Miller loop for Optimal ATE pairing e(P,Q) |
| * |
| @param r FP48 result of the pairing calculation e(P,Q) |
| @param P ECP8 instance, an element of G2 |
| @param Q ECP instance, an element of G1 |
| |
| */ |
| extern void PAIR_ate(YYY::FP48 *r,ECP8 *P,ECP *Q); |
| /** @brief Calculate Miller loop for Optimal ATE double-pairing e(P,Q).e(R,S) |
| * |
| Faster than calculating two separate pairings |
| @param r FP48 result of the pairing calculation e(P,Q).e(R,S), an element of GT |
| @param P ECP8 instance, an element of G2 |
| @param Q ECP instance, an element of G1 |
| @param R ECP8 instance, an element of G2 |
| @param S ECP instance, an element of G1 |
| */ |
| extern void PAIR_double_ate(YYY::FP48 *r,ECP8 *P,ECP *Q,ECP8 *R,ECP *S); |
| /** @brief Final exponentiation of pairing, converts output of Miller loop to element in GT |
| * |
| Here p is the internal modulus, and r is the group order |
| @param x FP48, on exit = x^((p^12-1)/r) |
| */ |
| extern void PAIR_fexp(YYY::FP48 *x); |
| /** @brief Fast point multiplication of a member of the group G1 by a BIG number |
| * |
| May exploit endomorphism for speed. |
| @param Q ECP member of G1. |
| @param b BIG multiplier |
| |
| */ |
| extern void PAIR_G1mul(ECP *Q,XXX::BIG b); |
| /** @brief Fast point multiplication of a member of the group G2 by a BIG number |
| * |
| May exploit endomorphism for speed. |
| @param P ECP8 member of G1. |
| @param b BIG multiplier |
| |
| */ |
| extern void PAIR_G2mul(ECP8 *P,XXX::BIG b); |
| /** @brief Fast raising of a member of GT to a BIG power |
| * |
| May exploit endomorphism for speed. |
| @param x FP48 member of GT. |
| @param b BIG exponent |
| |
| */ |
| extern void PAIR_GTpow(YYY::FP48 *x,XXX::BIG b); |
| /** @brief Tests FP48 for membership of GT |
| * |
| @param x FP48 instance |
| @return 1 if x is in GT, else return 0 |
| |
| */ |
| extern int PAIR_GTmember(YYY::FP48 *x); |
| |
| /** @brief Precompute line functions for n-pairing |
| * |
| @param r array of precomputed FP48 products of line functions |
| @param PV ECP8 instance, an element of G2 |
| @param QV ECP instance, an element of G1 |
| |
| */ |
| extern void PAIR_another(YYY::FP48 r[],ECP8* PV,ECP* QV); |
| |
| /** @brief Prepare Ate parameter |
| * |
| @param n BIG parameter |
| @param n3 BIG paramter = 3*n |
| @return number of nits in n3 |
| |
| */ |
| extern int PAIR_nbits(XXX::BIG n3,XXX::BIG n); |
| |
| /** @brief Initialise structure for multi-pairing |
| * |
| @param r FP48 array, to be initialised to 1 |
| |
| */ |
| extern void PAIR_initmp(YYY::FP48 r[]); |
| |
| |
| /** @brief Miller loop |
| * |
| @param res FP48 result |
| @param r FP48 precomputed array of accumulated line functions |
| |
| */ |
| extern void PAIR_miller(YYY::FP48 *res,YYY::FP48 r[]); |
| |
| } |
| |
| #endif |