Struct Poly 

pub struct Poly<T: Field, const N: usize>(/* private fields */);

Implementations

impl Poly<DilithiumFq, DILITHIUM_N>

pub fn new_random<R: RngCore + CryptoRng>(rng: &mut R) -> Self

pub fn into_array(self) -> [<<Self as Polynomial>::F as Field>::E; 256]

impl Poly<KyberFq, { KYBER_N / 2 }>

pub fn serialize(&self, bytes: &mut [u8; 384])

pub fn deserialize(&mut self, bytes: &[u8])

pub fn cbd2(&mut self, buf: &[u8; 128])

pub fn cbd3(&mut self, buf: &[u8; 192])

pub fn getnoise_eta1<const K: usize>( &mut self, prf: &mut Prf, seed: &[u8; 32], nonce: u8, )

pub fn getnoise_eta2(&mut self, prf: &mut Prf, seed: &[u8; 32], nonce: u8)

pub fn ntt_and_reduce(&mut self)

pub fn into_array(self) -> [<KyberFq as Field>::E; 256]

pub fn compress_slice<const D: usize>(&self, ct: &mut [u8])

pub fn decompress_slice<const D: usize>(&mut self, ct: &[u8])

pub fn compress<const D: usize>(&self, ct: &mut [[u8; D]; 32])

pub fn decompress<const D: usize>(&mut self, ct: &[[u8; D]; 32])

pub fn set_from_message(&mut self, msg: &[u8; 32])

pub fn from_message(msg: &[u8; 32]) -> Self

pub fn compress_to_message(&self, msg: &mut [u8; 32])

pub fn scale_mont(&mut self)

Inplace conversion of all coefficients of a polynomial from normal domain to Montgomery domain

Arguments

• r - Input/output polynomial

Trait Implementations

impl<T: Field, const N: usize> AddAssign<&Poly<T, N>> for Poly<T, N>

Adds rhs polynomial to self; no modular reduction is performed.

Arguments

• rhs - Righthand-side input polynomial

fn add_assign(&mut self, rhs: &Self)

Performs the += operation.

impl<F: Field, const N: usize> AsMut<[F; N]> for Poly<F, N>

fn as_mut(&mut self) -> &mut [F; N]

Converts this type into a mutable reference of the (usually inferred) input type.

impl<F: Field, const N: usize> AsRef<[F; N]> for Poly<F, N>

fn as_ref(&self) -> &[F; N]

Converts this type into a shared reference of the (usually inferred) input type.

impl<T: Clone + Field, const N: usize> Clone for Poly<T, N>

fn clone(&self) -> Poly<T, N>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug + Field, const N: usize> Debug for Poly<T, N>

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

Formats the value using the given formatter.

impl<T: Field, const N: usize> Default for Poly<T, N>

fn default() -> Self

Returns the “default value” for a type.

impl<T: Field, const N: usize> Index<usize> for Poly<T, N>

type Output = T

The returned type after indexing.

fn index(&self, i: usize) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<T: Field, const N: usize> IndexMut<usize> for Poly<T, N>

fn index_mut(&mut self, i: usize) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<'a, F: Field, const N: usize> IntoIterator for &'a Poly<F, N>

type Item = &'a F

The type of the elements being iterated over.

type IntoIter = Iter<'a, F>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Iter<'a, F>

Creates an iterator from a value.

impl<'a, F: Field, const N: usize> IntoIterator for &'a mut Poly<F, N>

type Item = &'a mut F

The type of the elements being iterated over.

type IntoIter = IterMut<'a, F>

Which kind of iterator are we turning this into?

fn into_iter(self) -> IterMut<'a, F>

Creates an iterator from a value.

impl<T: PartialEq + Field, const N: usize> PartialEq for Poly<T, N>

fn eq(&self, other: &Poly<T, N>) -> 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<T: Field, const N: usize> SubAssign<&Poly<T, N>> for Poly<T, N>

Subtracts rhs polynomial from self, i.e. self <- self - rhs ; no modular reduction is performed.

Arguments

• rhs - Righthand-side input polynomial

fn sub_assign(&mut self, rhs: &Self)

Performs the -= operation.

impl<T: Copy + Field, const N: usize> Copy for Poly<T, N>

impl<T: Field, const N: usize> StructuralPartialEq for Poly<T, N>