#include <bn.h>

Inheritance diagram for bn::Fp2T< T >:

[legend]

Collaboration diagram for bn::Fp2T< T >:

[legend]

Classes
struct	Dbl

Public Types
typedef T	Fp

Public Member Functions
	Fp2T ()

	Fp2T (int x)

	Fp2T (const Fp &a, const Fp &b)

Fp *	get ()

const Fp *	get () const

bool	isZero () const

void	inverse ()

void	clear ()

std::string	toString (int base=10) const

bool	operator== (const Fp2T &rhs) const

bool	operator!= (const Fp2T &rhs) const

void	set (const std::string &str)

void	mul_x ()

Public Member Functions inherited from mie::local::addsubmul< Fp2T< T >, mie::local::hasNegative< Fp2T< T > > >
MIE_FORCE_INLINE T &	operator+= (const N &rhs)

MIE_FORCE_INLINE T &	operator-= (const T &rhs)

MIE_FORCE_INLINE T &	operator*= (const T &rhs)

Public Member Functions inherited from mie::local::hasNegative< Fp2T< T > >
MIE_FORCE_INLINE T	operator- () const

Static Public Member Functions
static void	addC (Fp2T &z, const Fp2T &x, const Fp2T &y)

static void	addNC_C (Fp2T &z, const Fp2T &x, const Fp2T &y)

static void	subNC_C (Fp2T &z, const Fp2T &x, const Fp2T &y)

static void	subC (Fp2T &z, const Fp2T &x, const Fp2T &y)

static void	neg (Fp2T &z, const Fp2T &x)

static void	mulC (Fp2T &z, const Fp2T &x, const Fp2T &y)

static void	divBy2C (Fp2T &z, const Fp2T &x)

static void	divBy4 (Fp2T &z, const Fp2T &x)

static void	mul_xiC (Fp2T &z, const Fp2T &x)

static void	squareC (Fp2T &z, const Fp2T &x)

static void	mul_Fp_0C (Fp2T &z, const Fp2T &x, const Fp &b)

static void	mul_Fp_1 (Fp2T &z, const Fp &y_b)

Public Attributes
Fp	a_

Fp	b_

Static Public Attributes
static void(*	add )(Fp2T &z, const Fp2T &x, const Fp2T &y)

static void(*	addNC )(Fp2T &z, const Fp2T &x, const Fp2T &y)

static void(*	sub )(Fp2T &z, const Fp2T &x, const Fp2T &y)

static void(*	subNC )(Fp2T &z, const Fp2T &x, const Fp2T &y)

static void(*	mul )(Fp2T &z, const Fp2T &x, const Fp2T &y)

static void(*	square )(Fp2T &z, const Fp2T &x)

static void(*	mul_xi )(Fp2T &z, const Fp2T &x)

static void(*	mul_Fp_0 )(Fp2T &z, const Fp2T &x, const Fp &b)

static void(*	divBy2 )(Fp2T &z, const Fp2T &x)

Friends
std::ostream &	operator<< (std::ostream &os, const Fp2T &x)

std::istream &	operator>> (std::istream &is, Fp2T &x)

Detailed Description

template<class T>
struct bn::Fp2T< T >

Definition at line 347 of file bn.h.

Member Typedef Documentation

◆ Fp

template<class T >

T bn::Fp2T< T >::Fp

Definition at line 349 of file bn.h.

Constructor & Destructor Documentation

◆ Fp2T() [1/3]

template<class T >

bn::Fp2T< T >::Fp2T ( )

inline

Definition at line 351 of file bn.h.

351{ }

◆ Fp2T() [2/3]

template<class T >

bn::Fp2T< T >::Fp2T ( int x )

inline

Definition at line 352 of file bn.h.

        : a_(x)
        , b_(0)
    {
    }

◆ Fp2T() [3/3]

template<class T >

bn::Fp2T< T >::Fp2T	(	const Fp &	a,
		const Fp &	b )

inline

Definition at line 357 of file bn.h.

        : a_(a)
        , b_(b)
    {
    }

Member Function Documentation

◆ addC()

template<class T >

static void bn::Fp2T< T >::addC	(	Fp2T< T > &	z,
		const Fp2T< T > &	x,
		const Fp2T< T > &	y )

inlinestatic

Definition at line 378 of file bn.h.

    {
        Fp::add(z.a_, x.a_, y.a_);
        Fp::add(z.b_, x.b_, y.b_);
    }

◆ addNC_C()

template<class T >

static void bn::Fp2T< T >::addNC_C	(	Fp2T< T > &	z,
		const Fp2T< T > &	x,
		const Fp2T< T > &	y )

inlinestatic

Definition at line 383 of file bn.h.

    {
        Fp::addNC(z.a_, x.a_, y.a_);
        Fp::addNC(z.b_, x.b_, y.b_);
    }

◆ clear()

template<class T >

void bn::Fp2T< T >::clear ( )

inline

Definition at line 515 of file bn.h.

    {
        a_.clear();
        b_.clear();
    }

◆ divBy2C()

template<class T >

static void bn::Fp2T< T >::divBy2C	(	Fp2T< T > &	z,
		const Fp2T< T > &	x )

inlinestatic

Definition at line 428 of file bn.h.

    {
        Fp::divBy2(z.a_, x.a_);
        Fp::divBy2(z.b_, x.b_);
    }

Here is the call graph for this function:

◆ divBy4()

template<class T >

static void bn::Fp2T< T >::divBy4	(	Fp2T< T > &	z,
		const Fp2T< T > &	x )

inlinestatic

Definition at line 434 of file bn.h.

    {
        Fp::divBy4(z.a_, x.a_);
        Fp::divBy4(z.b_, x.b_);
    }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ get() [1/2]

template<class T >

Fp * bn::Fp2T< T >::get ( )

inline

Definition at line 362 of file bn.h.

362{ return &a_; }

◆ get() [2/2]

template<class T >

const Fp * bn::Fp2T< T >::get ( ) const

inline

Definition at line 363 of file bn.h.

363{ return &a_; }

◆ inverse()

template<class T >

void bn::Fp2T< T >::inverse ( )

inline

Definition at line 505 of file bn.h.

    {
        Fp t; Fp::mul(t, b_, b_);
        Fp aa; Fp::mul(aa, a_, a_);
        t += aa;
        Fp::inv(t, t); // 7.5K@i7, 10Kclk@Opteron
        a_ *= t;
        Fp::neg(b_, b_);
        b_ *= t;
    }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ isZero()

template<class T >

bool bn::Fp2T< T >::isZero ( ) const

inline

Definition at line 364 of file bn.h.

    {
        return a_.isZero() && b_.isZero();
    }

Here is the caller graph for this function:

◆ mul_Fp_0C()

template<class T >

static void bn::Fp2T< T >::mul_Fp_0C	(	Fp2T< T > &	z,
		const Fp2T< T > &	x,
		const Fp &	b )

inlinestatic

Definition at line 549 of file bn.h.

    {
        Fp::mul(z.a_, x.a_, b);
        Fp::mul(z.b_, x.b_, b);
    }

◆ mul_Fp_1()

template<class T >

static void bn::Fp2T< T >::mul_Fp_1	(	Fp2T< T > &	z,
		const Fp &	y_b )

inlinestatic

Definition at line 575 of file bn.h.

    {
        Fp t;
        Fp::mul(t, z.b_, y_b);
        Fp::mul(z.b_, z.a_, y_b);
        Fp::neg(z.a_, t);
    }

Here is the caller graph for this function:

◆ mul_x()

template<class T >

void bn::Fp2T< T >::mul_x ( )

inline

Definition at line 561 of file bn.h.

    {
        Fp t = b_;
        b_ = a_;
        Fp::neg(a_, t);
    }

◆ mul_xiC()

template<class T >

static void bn::Fp2T< T >::mul_xiC	(	Fp2T< T > &	z,
		const Fp2T< T > &	x )

inlinestatic

Definition at line 470 of file bn.h.

    {
        assert(&z != &x);
        Fp::sub(z.a_, x.a_, x.b_);
        Fp::add(z.b_, x.a_, x.b_);
    }

◆ mulC()

template<class T >

static void bn::Fp2T< T >::mulC	(	Fp2T< T > &	z,
		const Fp2T< T > &	x,
		const Fp2T< T > &	y )

inlinestatic

Definition at line 412 of file bn.h.

    {
        typename Fp::Dbl d[3];
        Fp s, t;
        Fp::addNC(s, x.a_, x.b_); // a + b
        Fp::addNC(t, y.a_, y.b_); // c + d
        Fp::Dbl::mul(d[0], s, t); // (a + b)(c + d)
        Fp::Dbl::mul(d[1], x.a_, y.a_); // ac
        Fp::Dbl::mul(d[2], x.b_, y.b_); // bd
        Fp::Dbl::subNC(d[0], d[0], d[1]); // (a + b)(c + d) - ac
        Fp::Dbl::subNC(d[0], d[0], d[2]); // (a + b)(c + d) - ac - bd
        Fp::Dbl::mod(z.b_, d[0]); // set z[1]
        Fp::Dbl::sub(d[1], d[1], d[2]); // ac - bd
        Fp::Dbl::mod(z.a_, d[1]); // set z[0]
    }

◆ neg()

template<class T >

static void bn::Fp2T< T >::neg	(	Fp2T< T > &	z,
		const Fp2T< T > &	x )

inlinestatic

Definition at line 400 of file bn.h.

    {
        Fp::neg(z.a_, x.a_);
        Fp::neg(z.b_, x.b_);
    }

Here is the caller graph for this function:

◆ operator!=()

template<class T >

bool bn::Fp2T< T >::operator!= ( const Fp2T< T > & rhs ) const

inline

Definition at line 540 of file bn.h.

540{ return !operator==(rhs); }

bn::Fp2T::operator==

bool operator==(const Fp2T &rhs) const

Definition bn.h:536

Here is the call graph for this function:

◆ operator==()

template<class T >

bool bn::Fp2T< T >::operator== ( const Fp2T< T > & rhs ) const

inline

Definition at line 536 of file bn.h.

    {
        return a_ == rhs.a_ && b_ == rhs.b_;
    }

Here is the caller graph for this function:

◆ set()

template<class T >

void bn::Fp2T< T >::set ( const std::string & str )

inline

Definition at line 542 of file bn.h.

    {
        std::istringstream iss(str);
        iss >> *this;
    }

◆ squareC()

template<class T >

static void bn::Fp2T< T >::squareC	(	Fp2T< T > &	z,
		const Fp2T< T > &	x )

inlinestatic

Definition at line 481 of file bn.h.

    {
#ifdef BN_SUPPORT_SNARK
        Fp t, tt;
        Fp::add(t, x.b_, x.b_); // 2b
        t *= x.a_; // 2ab
        Fp::sub(tt, x.a_, x.b_); // a - b
        Fp::add(z.a_, x.a_, x.b_); // a + b
        z.a_ *= tt; // (a - b)(a + b)
        z.b_ = t;
#else
        Fp t, tt;
        Fp::addNC(t, x.b_, x.b_); // 2b
        t *= x.a_; // 2ab
        Fp::sub(tt, x.a_, x.b_); // a - b
        Fp::addNC(z.a_, x.a_, x.a_); // a + b
        z.a_ *= tt; // (a - b)(a + b)
        z.b_ = t;
#endif
    }

◆ subC()

template<class T >

static void bn::Fp2T< T >::subC	(	Fp2T< T > &	z,
		const Fp2T< T > &	x,
		const Fp2T< T > &	y )

inlinestatic

Definition at line 395 of file bn.h.

    {
        Fp::sub(z.a_, x.a_, y.a_);
        Fp::sub(z.b_, x.b_, y.b_);
    }

◆ subNC_C()

template<class T >

static void bn::Fp2T< T >::subNC_C	(	Fp2T< T > &	z,
		const Fp2T< T > &	x,
		const Fp2T< T > &	y )

inlinestatic

Definition at line 389 of file bn.h.

    {
        Fp::subNC(z.a_, x.a_, y.a_);
        Fp::subNC(z.b_, x.b_, y.b_);
    }

◆ toString()

template<class T >

std::string bn::Fp2T< T >::toString ( int base = 10 ) const

inline

Definition at line 521 of file bn.h.

    {
        return ("[" + a_.toString(base) + "," + b_.toString(base) + "]");
    }

Here is the call graph for this function:

Here is the caller graph for this function:

Friends And Related Symbol Documentation

◆ operator<<

template<class T >

std::ostream & operator<<	(	std::ostream &	os,
		const Fp2T< T > &	x )

friend

Definition at line 525 of file bn.h.

    {
        return os << x.toString();
    }

◆ operator>>

template<class T >

std::istream & operator>>	(	std::istream &	is,
		Fp2T< T > &	x )

friend

Definition at line 529 of file bn.h.

    {
        char cl, cm, cr;
        is >> cl >> x.a_ >> cm >> x.b_ >> cr;
        if (cl == '[' && cm == ',' && cr == ']') return is;
        throw std::ios_base::failure("bad Fp2");
    }

Member Data Documentation

◆ a_

template<class T >

Fp bn::Fp2T< T >::a_

Definition at line 350 of file bn.h.

◆ add

template<class T >

void(* bn::Fp2T< T >::add) (Fp2T &z, const Fp2T &x, const Fp2T &y)

static

Definition at line 368 of file bn.h.

◆ addNC

template<class T >

void(* bn::Fp2T< T >::addNC) (Fp2T &z, const Fp2T &x, const Fp2T &y)

static

Definition at line 369 of file bn.h.

◆ b_

template<class T >

Fp bn::Fp2T< T >::b_

Definition at line 350 of file bn.h.

◆ divBy2

template<class T >

void(* bn::Fp2T< T >::divBy2) (Fp2T &z, const Fp2T &x)

static

Definition at line 376 of file bn.h.

◆ mul

template<class T >

void(* bn::Fp2T< T >::mul) (Fp2T &z, const Fp2T &x, const Fp2T &y)

static

Definition at line 372 of file bn.h.

◆ mul_Fp_0

template<class T >

void(* bn::Fp2T< T >::mul_Fp_0) (Fp2T &z, const Fp2T &x, const Fp &b)

static

Definition at line 375 of file bn.h.

◆ mul_xi

template<class T >

void(* bn::Fp2T< T >::mul_xi) (Fp2T &z, const Fp2T &x)

static

Definition at line 374 of file bn.h.

◆ square

template<class T >

void(* bn::Fp2T< T >::square) (Fp2T &z, const Fp2T &x)

static

Definition at line 373 of file bn.h.

◆ sub

template<class T >

void(* bn::Fp2T< T >::sub) (Fp2T &z, const Fp2T &x, const Fp2T &y)

static

Definition at line 370 of file bn.h.

◆ subNC

template<class T >

void(* bn::Fp2T< T >::subNC) (Fp2T &z, const Fp2T &x, const Fp2T &y)

static

Definition at line 371 of file bn.h.

The documentation for this struct was generated from the following file:

libraries/fc/libraries/ff/depends/ate-pairing/include/bn.h

Classes

Public Types

Public Member Functions

Static Public Member Functions

Public Attributes

Static Public Attributes

Friends

Detailed Description

Member Typedef Documentation

◆ Fp

Constructor & Destructor Documentation

◆ Fp2T() [1/3]

◆ Fp2T() [2/3]

◆ Fp2T() [3/3]

Member Function Documentation

◆ addC()

◆ addNC_C()

◆ clear()

◆ divBy2C()

◆ divBy4()

◆ get() [1/2]

◆ get() [2/2]

◆ inverse()

◆ isZero()

◆ mul_Fp_0C()

◆ mul_Fp_1()

◆ mul_x()

◆ mul_xiC()

◆ mulC()

◆ neg()

◆ operator!=()

◆ operator==()

◆ set()

◆ squareC()

◆ subC()

◆ subNC_C()

◆ toString()

Friends And Related Symbol Documentation

◆ operator<<

◆ operator>>

Member Data Documentation

◆ a_

◆ add

◆ addNC

◆ b_

◆ divBy2

◆ mul

◆ mul_Fp_0

◆ mul_xi

◆ square

◆ sub

◆ subNC