Struct PolyVec 

pub struct PolyVec<P, const N: usize, const K: usize>(/* private fields */)
where
    P: Polynomial;

Implementations

impl<const N: usize, const K: usize> PolyVec<KyberPoly, N, K>

pub fn new_deserialize(bytes: &[[u8; 384]; K]) -> Self

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

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

impl<const K: usize> PolyVec<Poly<KyberFq, { KYBER_N / 2 }>, { KyberPoly::N }, K>

pub fn getnoise_eta1(&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 compress<const D: usize>(&self, ct: &mut [[[u8; D]; 32]; K])

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

impl<const K: usize> PolyVec<Poly<DilithiumFq, DILITHIUM_N>, { DilithiumPoly::N }, K>

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

Trait Implementations

impl<P, const N: usize, const K: usize> AddAssign<&PolyVec<P, N, K>> for PolyVec<P, N, K>

where P: Polynomial,

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

Performs the += operation.

impl<P, const N: usize, const K: usize> AsMut<[P; K]> for PolyVec<P, N, K>

where P: Polynomial,

fn as_mut(&mut self) -> &mut [P; K]

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

impl<P, const N: usize, const K: usize> AsRef<[P; K]> for PolyVec<P, N, K>

where P: Polynomial,

fn as_ref(&self) -> &[P; K]

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

impl<P, const N: usize, const K: usize> Clone for PolyVec<P, N, K>

where P: Polynomial + Clone,

fn clone(&self) -> PolyVec<P, N, K>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<P, const N: usize, const K: usize> Debug for PolyVec<P, N, K>

where P: Polynomial + Debug,

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

Formats the value using the given formatter.

impl<P, const N: usize, const K: usize> Default for PolyVec<P, N, K>

where P: Polynomial,

fn default() -> Self

Returns the “default value” for a type.

impl<P, const N: usize, const K: usize> Index<usize> for PolyVec<P, N, K>

where P: Polynomial,

type Output = P

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<P, const N: usize, const K: usize> IndexMut<usize> for PolyVec<P, N, K>

where P: Polynomial,

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

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

impl<'a, P, const N: usize, const K: usize> IntoIterator for &'a PolyVec<P, N, K>

where P: Polynomial,

type Item = &'a P

The type of the elements being iterated over.

type IntoIter = Iter<'a, P>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, const N: usize, P, const K: usize> IntoIterator for &'a mut PolyVec<P, N, K>

where P: Polynomial,

type Item = &'a mut P

The type of the elements being iterated over.

type IntoIter = IterMut<'a, P>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<P, const N: usize, const K: usize> PolynomialVector for PolyVec<P, N, K>

where P: SizedPolynomial<N>,

const K: usize = K

type Poly = P

fn ntt(&mut self)

fn ntt_and_reduce(&mut self)

fn inv_ntt_tomont(&mut self)

fn reduce(&mut self)

fn uniform_xof<const TRANSPOSED: bool>(&mut self, seed: &[u8; 32], i: u8)

fn basemul_acc( &self, other: &Self, result: &mut <Self as PolynomialVector>::Poly, )

impl<P, const N: usize, const K: usize> Copy for PolyVec<P, N, K>

where P: Polynomial + Copy,