Struct Polynomial 

pub struct Polynomial { /* private fields */ }

A polynomial over the ML-DSA ring.

Dev note: The following structure does not necessarily need to be declared as public. There is no real scenario where this function needs to be called directly. However, in order to test the Debug and Display traits, it is necessary to use STD, so those can’t be tested from inline tests in this file and the real unit tests are in a different crate. That’s the reason why pub is used.

🚨 Security 🚨

Polynomials themselves are not inherently secret since sometimes they are part of public keys and sometimes private keys. It is the responsibility of the caller to wrap sensitive instances in Secret<Polynomial>. Note: at the moment, nothing in this crate uses Secret<Polynomial>, so I have left the impl ZeroizablePrimitive commented-out.

Implementations

impl Polynomial

pub const fn new() -> Self

Create a new polynomial with all coefficients set to zero.

Trait Implementations

impl Clone for Polynomial

fn clone(&self) -> Polynomial

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Index<usize> for Polynomial

Convenience function to avoid “.0” all over the place.

type Output = i32

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl IndexMut<usize> for Polynomial

Convenience function to avoid “.0” all over the place.

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

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

impl Copy for Polynomial