Struct PolyRing

pub struct PolyRing { /* private fields */ }

A PolyRing is a vector of Zq elements with a flexible degree that is less than or equal to DEGREE_BOUND.

Implementations

impl PolyRing

pub const DEGREE_BOUND: usize = 64usize

pub fn new(coeffs: Vec<Zq>) -> Self

pub fn zero(degree: usize) -> Self

pub fn zero_poly() -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn get_coeffs(&self) -> &Vec<Zq>

pub fn iter(&self) -> impl Iterator<Item = &Zq>

pub fn iter_mut(&mut self) -> impl Iterator<Item = &mut Zq>

pub fn inner_product(&self, other: &Self) -> Zq

inner product of two polynomials

pub fn random<R: Rng + CryptoRng>(rng: &mut R, n: usize) -> Self

Generate random Zq vector with a provided cryptographically secure RNG

pub fn random_ternary<R: Rng + CryptoRng>(rng: &mut R, n: usize) -> Self

Generate random small polynomial with secure RNG implementation

pub fn conjugate_automorphism(&self) -> PolyRing

Compute the conjugate automorphism \sigma_{-1} of vector based on B) Constraints…, Page 21.

pub fn operator_norm(&self) -> f64

Compute the operator norm of a polynomial given its coefficients. The operator norm is defined as the maximum magnitude of the DFT (eigenvalues) of the coefficient vector.

Note that: The operator norm only affects the coefficients of the random PolyRings generated from the challenge space. Prover and Verifier will not do the operator norm check, because random PolyRings are determined after generation. Both party will have access to the same PolyRings through transcript,

pub fn decompose(&self, base: Zq, num_parts: usize) -> PolyVector

Decomposes a polynomial into base-B representation: p = p⁽⁰⁾ + p⁽¹⁾·B + p⁽²⁾·B² + … + p⁽ᵗ⁻¹⁾·B^(t-1) Where each p⁽ⁱ⁾ has small coefficients, using centered representatives

Trait Implementations

impl Add<&PolyRing> for &PolyRing

fn add(self, other: &PolyRing) -> PolyRing

Add two polynomials with flexible degree

type Output = PolyRing

The resulting type after applying the + operator.

impl Clone for PolyRing

fn clone(&self) -> PolyRing

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for PolyRing

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

Formats the value using the given formatter.

impl Default for PolyRing

fn default() -> PolyRing

Returns the “default value” for a type.

impl<const D: usize> From<PolyRing> for Rq<D>

fn from(zqs: PolyRing) -> Self

Converts to this type from the input type.

impl FromIterator<PolyRing> for PolyVector

fn from_iter<T: IntoIterator<Item = PolyRing>>(iter: T) -> Self

Creates a value from an iterator.

impl FromIterator<Zq> for PolyRing

fn from_iter<T: IntoIterator<Item = Zq>>(iter: T) -> Self

Creates a value from an iterator.

impl Mul<&PolyRing> for &PolyRing

fn mul(self, other: &PolyRing) -> PolyRing

Polynomial multiplication of two polynomials

type Output = PolyRing

The resulting type after applying the * operator.

impl Mul<&PolyRing> for &PolyVector

type Output = PolyVector

The resulting type after applying the * operator.

fn mul(self, other: &PolyRing) -> PolyVector

Performs the * operation.

impl Mul<&Zq> for &PolyRing

fn mul(self, other: &Zq) -> PolyRing

Scalar multiplication of a polynomial

type Output = PolyRing

The resulting type after applying the * operator.

impl Ord for PolyRing

fn cmp(&self, other: &PolyRing) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for PolyRing

fn eq(&self, other: &PolyRing) -> 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 PartialOrd for PolyRing

fn partial_cmp(&self, other: &PolyRing) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Sub<&PolyRing> for &PolyRing

fn sub(self, other: &PolyRing) -> PolyRing

Sub two polynomials with flexible degree

type Output = PolyRing

The resulting type after applying the - operator.

impl Eq for PolyRing

impl StructuralPartialEq for PolyRing