Struct FieldPolynomial

pub struct FieldPolynomial(pub Polynomial<BabyBearRingElement>);

Tuple Fields

0: Polynomial<BabyBearRingElement>

Trait Implementations

impl Add for FieldPolynomial

type Output = FieldPolynomial

The resulting type after applying the + operator.

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

Performs the + operation.

impl AddAssign for FieldPolynomial

fn add_assign(&mut self, other: Self)

Performs the += operation.

impl Clone for FieldPolynomial

fn clone(&self) -> FieldPolynomial

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for FieldPolynomial

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

Formats the value using the given formatter.

impl Display for FieldPolynomial

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

Formats the value using the given formatter.

impl Div for FieldPolynomial

type Output = FieldPolynomial

The resulting type after applying the / operator.

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

Performs the / operation.

impl FieldElement for FieldPolynomial

fn from_usize(value: usize) -> Self

Return a constant polynomial with the provided value

fn zero() -> Self

Get the zero element.

fn one() -> Self

Get the one element.

fn byte_len() -> usize

Minimum number of bytes needed to represent an element.

fn prime() -> BigUint

The prime modulus of the field as an arbitrary precision integer.

fn name_str() -> &'static str

A short string identifier for the field.

fn to_biguint(&self) -> BigUint

Get a num_bigint::BigUint representation for arbitrary precision operations.

fn from_biguint(_v: &BigUint) -> Self

Convert a num_bigint::BigUint into a field element precision operations. Numbers will be converted % self.prime()

fn from_bytes_le(bytes: &[u8]) -> Self

Parse an element from a byte representation. Panics if the byte representation is too long. e.g. if the bytes represent a value > Self::prime().

fn to_bytes_le(&self) -> Vec<u8>

Convert a field element to a byte representation. The number of bytes may be variable, but is guaranteed to be accepted by from_bytes_le for the same curve.

fn sample_uniform<R>(src: &mut R) -> Self

where R: Rng,

Sample a random element from the field using a supplied source of randomness. Requires the random feature to be enabled.

fn lower60_string(&self) -> String

A string representation of a field element using only the lower 60 bits of the element. A normal decimal representation will be given if it’s shorter than the lower 60 bit representation. This is a lossy representation.

fn log_floor(&self, b: Self) -> u32

Take a logarithm using a custom base and return the floored value. O(logb(n)) time complexity where n is the size of the element.

fn legendre(&self) -> i32

Calculate the legendre symbol for a field element. Used to determine if the element is a quadratic residue.

fn sqrt(&self) -> Self

Kumar 08 prime field square root implementation. Always returns the smaller root e.g. the positive root.

impl From<Polynomial<BabyBearRingElement>> for FieldPolynomial

fn from(p: Polynomial<BabyBearRingElement>) -> Self

Converts to this type from the input type.

impl From<u64> for FieldPolynomial

fn from(value: u64) -> Self

Converts to this type from the input type.

impl FromStr for FieldPolynomial

type Err = <BabyBearRingElement as FromStr>::Err

The associated error which can be returned from parsing.

fn from_str(s: &str) -> Result<Self, Self::Err>

Parses a string s to return a value of this type.

impl Hash for FieldPolynomial

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Mul for FieldPolynomial

type Output = FieldPolynomial

The resulting type after applying the * operator.

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

Performs the * operation.

impl MulAssign for FieldPolynomial

fn mul_assign(&mut self, other: Self)

Performs the *= operation.

impl Neg for FieldPolynomial

type Output = FieldPolynomial

The resulting type after applying the - operator.

fn neg(self) -> Self

Performs the unary - operation.

impl PartialEq for FieldPolynomial

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

type F = BabyBearRingElement

fn modulus() -> Polynomial<Self::F>

Modulus used in remainder division to form the polynomial ring.

fn polynomial(&self) -> &Polynomial<Self::F>

Return the Polynomial representation of the current value Used to automatically implement norms and other functions.

fn from_polynomial(p: Polynomial<Self::F>) -> Self

Create a polynomial ring element from a Polynomial with terms in the ring’s scalar field.

fn to_scalar(&self) -> Result<Self::F, Error>

Attempt to get a scalar representation of the polynomial. If the polynomial degree is > 0 this method will error.

fn norm_l1(&self) -> BigUint

Calculate the l1 norm for this polynomial. That is the summation of all coefficients

fn norm_l2(&self) -> BigUint

Calculate the l2 norm for this polynomial. That is the square root of the summation of each coefficient squared

fn norm_max(&self) -> BigUint

Calculate the l-infinity norm for this polynomial. That is the largest coefficient

fn coef(&self) -> Vector<Self::F>

Returns a coefficient vector of length equal to the ring modulus degree.

fn rot(&self) -> Matrix2D<Self::F>

Create a rotated matrix of polynomial coefficients

impl Sub for FieldPolynomial

type Output = FieldPolynomial

The resulting type after applying the - operator.

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

Performs the - operation.

impl SubAssign for FieldPolynomial

fn sub_assign(&mut self, other: Self)

Performs the -= operation.

impl Eq for FieldPolynomial

impl StructuralPartialEq for FieldPolynomial