|
@ -106,7 +106,7 @@ impl PG, P::Fp> for PairingVar { |
|
|
// it work for curves with odd `P::X`.
|
|
|
// it work for curves with odd `P::X`.
|
|
|
// Hence we implement the slower algorithm from Table 1 below.
|
|
|
// Hence we implement the slower algorithm from Table 1 below.
|
|
|
|
|
|
|
|
|
let f1 = f.frobenius_map(6)?;
|
|
|
|
|
|
|
|
|
let f1 = f.unitary_inverse()?;
|
|
|
|
|
|
|
|
|
f.inverse().and_then(|mut f2| {
|
|
|
f.inverse().and_then(|mut f2| {
|
|
|
// f2 = f^(-1);
|
|
|
// f2 = f^(-1);
|
|
|