fp6_2over3.hpp

Go to the documentation of this file.

 
#ifndef FP6_2OVER3_HPP_
#define FP6_2OVER3_HPP_
#include <libff/algebra/fields/fp.hpp>
#include <libff/algebra/fields/fp2.hpp>
#include <libff/algebra/fields/fp3.hpp>
 
namespace libff
{
 
template<mp_size_t n, const bigint<n> &modulus> class Fp6_2over3_model;
 
template<mp_size_t n, const bigint<n> &modulus>
std::ostream &operator<<(std::ostream &, const Fp6_2over3_model<n, modulus> &);
 
template<mp_size_t n, const bigint<n> &modulus>
std::istream &operator>>(std::istream &, Fp6_2over3_model<n, modulus> &);
 
template<mp_size_t n, const bigint<n> &modulus> class Fp6_2over3_model
{
public:
    typedef Fp_model<n, modulus> my_Fp;
    typedef Fp2_model<n, modulus> my_Fp2;
    typedef Fp3_model<n, modulus> my_Fp3;
    typedef my_Fp3 my_Fpe;
 
    static my_Fp non_residue;
    static my_Fp Frobenius_coeffs_c1[6];
 
    static const size_t tower_extension_degree = 2;
 
    my_Fp3 coeffs[2];
    Fp6_2over3_model(){};
    Fp6_2over3_model(const my_Fp3 &c0, const my_Fp3 &c1)
    {
        this->coeffs[0] = c0;
        this->coeffs[1] = c1;
        return;
    };
 
    void print() const
    {
        printf("c0/c1:\n");
        coeffs[0].print();
        coeffs[1].print();
    }
    void clear()
    {
        coeffs[0].clear();
        coeffs[1].clear();
    }
 
    static Fp6_2over3_model<n, modulus> zero();
    static Fp6_2over3_model<n, modulus> one();
    static Fp6_2over3_model<n, modulus> random_element();
 
    bool is_zero() const { return coeffs[0].is_zero() && coeffs[1].is_zero(); }
    bool operator==(const Fp6_2over3_model &other) const;
    bool operator!=(const Fp6_2over3_model &other) const;
 
    Fp6_2over3_model operator+(const Fp6_2over3_model &other) const;
    Fp6_2over3_model operator-(const Fp6_2over3_model &other) const;
    Fp6_2over3_model operator*(const Fp6_2over3_model &other) const;
    Fp6_2over3_model mul_by_045(
        const my_Fp &ell_0, const my_Fp &ell_VW, const my_Fp &ell_VV) const;
    Fp6_2over3_model mul_by_2345(const Fp6_2over3_model &other) const;
    Fp6_2over3_model operator-() const;
    Fp6_2over3_model squared() const;
    Fp6_2over3_model inverse() const;
    Fp6_2over3_model Frobenius_map(unsigned long power) const;
    Fp6_2over3_model unitary_inverse() const;
    Fp6_2over3_model cyclotomic_squared() const;
 
    static my_Fp3 mul_by_non_residue(const my_Fp3 &elem);
 
    template<mp_size_t m>
    Fp6_2over3_model cyclotomic_exp(const bigint<m> &exponent) const;
 
    static bigint<n> base_field_char() { return modulus; }
    static constexpr size_t extension_degree() { return 6; }
 
    friend std::ostream &operator<<<n, modulus>(
        std::ostream &out, const Fp6_2over3_model<n, modulus> &el);
    friend std::istream &operator>>
        <n, modulus>(std::istream &in, Fp6_2over3_model<n, modulus> &el);
};
 
template<mp_size_t n, const bigint<n> &modulus>
std::ostream &operator<<(
    std::ostream &out, const std::vector<Fp6_2over3_model<n, modulus>> &v);
 
template<mp_size_t n, const bigint<n> &modulus>
std::istream &operator>>(
    std::istream &in, std::vector<Fp6_2over3_model<n, modulus>> &v);
 
template<mp_size_t n, const bigint<n> &modulus>
Fp6_2over3_model<n, modulus> operator*(
    const Fp_model<n, modulus> &lhs, const Fp6_2over3_model<n, modulus> &rhs);
 
template<mp_size_t n, const bigint<n> &modulus, mp_size_t m>
Fp6_2over3_model<n, modulus> operator^(
    const Fp6_2over3_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>
Fp6_2over3_model<n, modulus> operator^(
    const Fp6_2over3_model<n, modulus> &self,
    const Fp_model<m, exp_modulus> &exponent);
 
template<mp_size_t n, const bigint<n> &modulus>
Fp_model<n, modulus> Fp6_2over3_model<n, modulus>::non_residue;
 
template<mp_size_t n, const bigint<n> &modulus>
Fp_model<n, modulus> Fp6_2over3_model<n, modulus>::Frobenius_coeffs_c1[6];
 
} // namespace libff
 
#include <libff/algebra/fields/fp6_2over3.tcc>
 
#endif // FP6_2OVER3_HPP_