Struct NttPolynomial 

pub struct NttPolynomial<F: Field>(pub Array<Elem<F>, U256>);

An NttPolynomial is a member of the NTT algebra T_q = Z_q[X]^256 of 256-tuples of field elements. NTT polynomials can be added and subtracted, negated, and multiplied by scalars. We do not define multiplication of NTT polynomials here. We also do not define the mappings between normal polynomials and NTT polynomials (i.e., between R_q and T_q).

Tuple Fields

0: Array<Elem<F>, U256>

Implementations

impl<F: Field> NttPolynomial<F>

pub const fn new(x: Array<Elem<F>, U256>) -> Self

Trait Implementations

impl<F: Field> Add<&NttPolynomial<F>> for &NttPolynomial<F>

type Output = NttPolynomial<F>

The resulting type after applying the + operator.

fn add(self, rhs: &NttPolynomial<F>) -> NttPolynomial<F>

Performs the + operation.

impl<F: Clone + Field> Clone for NttPolynomial<F>

fn clone(&self) -> NttPolynomial<F>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<F: Debug + Field> Debug for NttPolynomial<F>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<F: Default + Field> Default for NttPolynomial<F>

fn default() -> NttPolynomial<F>

Returns the “default value” for a type.

impl<F: Field, D: EncodingSize> Encode<D> for NttPolynomial<F>

type EncodedSize = <D as EncodingSize>::EncodedPolynomialSize

fn encode(&self) -> Array<u8, Self::EncodedSize>

fn decode(enc: &Array<u8, Self::EncodedSize>) -> Self

impl Mul<&NttPolynomial<BaseField>> for &NttPolynomial<BaseField>

type Output = NttPolynomial<BaseField>

The resulting type after applying the * operator.

fn mul(self, rhs: &NttPolynomial<BaseField>) -> NttPolynomial<BaseField>

Performs the * operation.

impl<F: Field> Mul<&NttPolynomial<F>> for Elem<F>

type Output = NttPolynomial<F>

The resulting type after applying the * operator.

fn mul(self, rhs: &NttPolynomial<F>) -> NttPolynomial<F>

Performs the * operation.

impl<F: Field, K: ArraySize> Mul<&NttVector<F, K>> for &NttPolynomial<F>

where for<'a> &'a NttPolynomial<F>: Mul<&'a NttPolynomial<F>, Output = NttPolynomial<F>>,

type Output = NttVector<F, K>

The resulting type after applying the * operator.

fn mul(self, rhs: &NttVector<F, K>) -> NttVector<F, K>

Performs the * operation.

impl<F: Field> Neg for &NttPolynomial<F>

type Output = NttPolynomial<F>

The resulting type after applying the - operator.

fn neg(self) -> NttPolynomial<F>

Performs the unary - operation.

impl NttInverse for NttPolynomial<BaseField>

type Output = Polynomial<BaseField>

fn ntt_inverse(&self) -> Self::Output

impl<F: PartialEq + Field> PartialEq for NttPolynomial<F>

fn eq(&self, other: &NttPolynomial<F>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<F: Field> Sub<&NttPolynomial<F>> for &NttPolynomial<F>

type Output = NttPolynomial<F>

The resulting type after applying the - operator.

fn sub(self, rhs: &NttPolynomial<F>) -> NttPolynomial<F>

Performs the - operation.

impl<F: Field> StructuralPartialEq for NttPolynomial<F>