fp12_2over3over2.hpp

Go to the documentation of this file.

 
#ifndef FP12_2OVER3OVER2_HPP_
#define FP12_2OVER3OVER2_HPP_
#include <libff/algebra/fields/fp.hpp>
#include <libff/algebra/fields/fp2.hpp>
#include <libff/algebra/fields/fp6_3over2.hpp>
#include <vector>
 
namespace libff
{
 
template<mp_size_t n, const bigint<n> &modulus> class Fp12_2over3over2_model;
 
template<mp_size_t n, const bigint<n> &modulus>
std::ostream &operator<<(
    std::ostream &, const Fp12_2over3over2_model<n, modulus> &);
 
template<mp_size_t n, const bigint<n> &modulus>
std::istream &operator>>(std::istream &, Fp12_2over3over2_model<n, modulus> &);
 
template<mp_size_t n, const bigint<n> &modulus> class Fp12_2over3over2_model
{
public:
    // (modulus^12-1)/2
    static bigint<12 * n> euler;
    // modulus^12 = 2^s * t + 1
    static std::size_t s;
    // with t odd
    static bigint<12 * n> t;
    // (t-1)/2
    static bigint<12 * n> t_minus_1_over_2;
    // a quadratic nonresidue in Fp12
    static Fp12_2over3over2_model<n, modulus> nqr;
    // nqr^t
    static Fp12_2over3over2_model<n, modulus> nqr_to_t;
 
    typedef Fp_model<n, modulus> my_Fp;
    typedef Fp2_model<n, modulus> my_Fp2;
    typedef Fp6_3over2_model<n, modulus> my_Fp6;
 
    static Fp2_model<n, modulus> non_residue;
    static Fp2_model<n, modulus> Frobenius_coeffs_c1[12];
 
    static const size_t tower_extension_degree = 2;
 
    my_Fp6 coeffs[2];
    Fp12_2over3over2_model(){};
    Fp12_2over3over2_model(const my_Fp6 &c0, const my_Fp6 &c1)
    {
        this->coeffs[0] = c0;
        this->coeffs[1] = c1;
        return;
    };
 
    void clear()
    {
        coeffs[0].clear();
        coeffs[1].clear();
    }
    void print() const
    {
        printf("c0/c1:\n");
        coeffs[0].print();
        coeffs[1].print();
    }
 
    static Fp12_2over3over2_model<n, modulus> zero();
    static Fp12_2over3over2_model<n, modulus> one();
    static Fp12_2over3over2_model<n, modulus> random_element();
 
    bool is_zero() const { return coeffs[0].is_zero() && coeffs[1].is_zero(); }
    bool operator==(const Fp12_2over3over2_model &other) const;
    bool operator!=(const Fp12_2over3over2_model &other) const;
 
    Fp12_2over3over2_model operator+(const Fp12_2over3over2_model &other) const;
    Fp12_2over3over2_model operator-(const Fp12_2over3over2_model &other) const;
    Fp12_2over3over2_model operator*(const Fp12_2over3over2_model &other) const;
    Fp12_2over3over2_model operator-() const;
    Fp12_2over3over2_model squared() const;
    Fp12_2over3over2_model squared_karatsuba() const;
    Fp12_2over3over2_model squared_complex() const;
    Fp12_2over3over2_model inverse() const;
    Fp12_2over3over2_model Frobenius_map(unsigned long power) const;
    Fp12_2over3over2_model unitary_inverse() const;
    Fp12_2over3over2_model cyclotomic_squared() const;
 
    Fp12_2over3over2_model mul_by_024(
        const my_Fp2 &ell_0, const my_Fp2 &ell_VW, const my_Fp2 &ell_VV) const;
 
    Fp12_2over3over2_model mul_by_045(
        const my_Fp2 &ell_0, const my_Fp2 &ell_VW, const my_Fp2 &ell_VV) const;
 
    static my_Fp6 mul_by_non_residue(const my_Fp6 &elt);
 
    template<mp_size_t m>
    Fp12_2over3over2_model cyclotomic_exp(const bigint<m> &exponent) const;
 
    static bigint<n> base_field_char() { return modulus; }
    static constexpr size_t extension_degree() { return 12; }
 
    friend std::ostream &operator<<<n, modulus>(
        std::ostream &out, const Fp12_2over3over2_model<n, modulus> &el);
    friend std::istream &operator>>
        <n, modulus>(std::istream &in, Fp12_2over3over2_model<n, modulus> &el);
};
 
template<mp_size_t n, const bigint<n> &modulus>
std::ostream &operator<<(
    std::ostream &out,
    const std::vector<Fp12_2over3over2_model<n, modulus>> &v);
 
template<mp_size_t n, const bigint<n> &modulus>
std::istream &operator>>(
    std::istream &in, std::vector<Fp12_2over3over2_model<n, modulus>> &v);
 
template<mp_size_t n, const bigint<n> &modulus>
Fp12_2over3over2_model<n, modulus> operator*(
    const Fp_model<n, modulus> &lhs,
    const Fp12_2over3over2_model<n, modulus> &rhs);
 
template<mp_size_t n, const bigint<n> &modulus>
Fp12_2over3over2_model<n, modulus> operator*(
    const Fp2_model<n, modulus> &lhs,
    const Fp12_2over3over2_model<n, modulus> &rhs);
 
template<mp_size_t n, const bigint<n> &modulus>
Fp12_2over3over2_model<n, modulus> operator*(
    const Fp6_3over2_model<n, modulus> &lhs,
    const Fp12_2over3over2_model<n, modulus> &rhs);
 
template<mp_size_t n, const bigint<n> &modulus, mp_size_t m>
Fp12_2over3over2_model<n, modulus> operator^(
    const Fp12_2over3over2_model<n, modulus> &self, const bigint<m> &exponent);
 
template<
    mp_size_t n,
    const bigint<n> &modulus,
    mp_size_t m,
    const bigint<m> &exp_modulus>
Fp12_2over3over2_model<n, modulus> operator^(
    const Fp12_2over3over2_model<n, modulus> &self,
    const Fp_model<m, exp_modulus> &exponent);
 
template<mp_size_t n, const bigint<n> &modulus>
bigint<12 * n> Fp12_2over3over2_model<n, modulus>::euler;
 
template<mp_size_t n, const bigint<n> &modulus>
size_t Fp12_2over3over2_model<n, modulus>::s;
 
template<mp_size_t n, const bigint<n> &modulus>
bigint<12 * n> Fp12_2over3over2_model<n, modulus>::t;
 
template<mp_size_t n, const bigint<n> &modulus>
bigint<12 * n> Fp12_2over3over2_model<n, modulus>::t_minus_1_over_2;
 
template<mp_size_t n, const bigint<n> &modulus>
Fp12_2over3over2_model<n, modulus> Fp12_2over3over2_model<n, modulus>::nqr;
 
template<mp_size_t n, const bigint<n> &modulus>
Fp12_2over3over2_model<n, modulus> Fp12_2over3over2_model<n, modulus>::nqr_to_t;
 
template<mp_size_t n, const bigint<n> &modulus>
Fp2_model<n, modulus> Fp12_2over3over2_model<n, modulus>::non_residue;
 
template<mp_size_t n, const bigint<n> &modulus>
Fp2_model<n, modulus>
    Fp12_2over3over2_model<n, modulus>::Frobenius_coeffs_c1[12];
 
} // namespace libff
 
#include <libff/algebra/fields/fp12_2over3over2.tcc>
 
#endif // FP12_2OVER3OVER2_HPP_