Struct scuttlebutt::field::F61p

pub struct F61p(/* private fields */);

A finite field over the Mersenne Prime 2^61 - 1

Trait Implementations

impl<'a> Add<&'a F61p> for F61p

type Output = F61p

The resulting type after applying the + operator.

fn add(self, rhs: &'a F61p) -> Self::Output

Performs the + operation.

impl<'a> Add<F61p> for &'a F61p

type Output = F61p

The resulting type after applying the + operator.

fn add(self, rhs: F61p) -> Self::Output

Performs the + operation.

impl<'a> Add for &'a F61p

type Output = F61p

The resulting type after applying the + operator.

fn add(self, rhs: &'a F61p) -> Self::Output

Performs the + operation.

impl Add for F61p

type Output = F61p

The resulting type after applying the + operator.

fn add(self, rhs: F61p) -> Self::Output

Performs the + operation.

impl AddAssign<&F61p> for F61p

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

Performs the += operation.

impl AddAssign for F61p

fn add_assign(&mut self, rhs: F61p)

Performs the += operation.

impl CanonicalSerialize for F61p

type Serializer = ByteElementSerializer<F61p>

A way to serialize field elements of this type.

type Deserializer = ByteElementDeserializer<F61p>

A way to deserialize field elements of this type.

type ByteReprLen = UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>

The number of bytes in the byte representation for this element.

type FromBytesError = BiggerThanModulus

The error that can result from trying to decode an invalid byte sequence.

fn from_bytes( bytes: &GenericArray<u8, Self::ByteReprLen> ) -> Result<Self, Self::FromBytesError>

Deserialize an element from a byte array.

fn to_bytes(&self) -> GenericArray<u8, Self::ByteReprLen>

Serialize an element into a byte array.

impl Clone for F61p

fn clone(&self) -> F61p

Returns a copy of the value.

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

Performs copy-assignment from source.

impl ConditionallySelectable for F61p

fn conditional_select(a: &Self, b: &Self, choice: Choice) -> Self

Select a or b according to choice.

fn conditional_assign(&mut self, other: &Self, choice: Choice)

Conditionally assign other to self, according to choice.

fn conditional_swap(a: &mut Self, b: &mut Self, choice: Choice)

Conditionally swap self and other if choice == 1; otherwise, reassign both unto themselves.

impl ConstantTimeEq for F61p

fn ct_eq(&self, other: &Self) -> Choice

Determine if two items are equal.

fn ct_ne(&self, other: &Self) -> Choice

Determine if two items are NOT equal.

impl Debug for F61p

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

Formats the value using the given formatter.

impl Default for F61p

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for F61p

fn deserialize<D: Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error>

Deserialize this value from the given Serde deserializer.

impl Distribution<F61p> for Standard

fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> F61p

Generate a random value of T, using rng as the source of randomness.

fn sample_iter<R>(self, rng: R) -> DistIter<Self, R, T>

where R: Rng, Self: Sized,

Create an iterator that generates random values of T, using rng as the source of randomness.

fn map<F, S>(self, func: F) -> DistMap<Self, F, T, S>

where F: Fn(T) -> S, Self: Sized,

Create a distribution of values of ‘S’ by mapping the output of Self through the closure F

impl<'a> Div<&'a F61p> for F61p

type Output = F61p

The resulting type after applying the / operator.

fn div(self, rhs: &'a F61p) -> Self::Output

Performs the / operation.

impl<'a> Div<F61p> for &'a F61p

type Output = F61p

The resulting type after applying the / operator.

fn div(self, rhs: F61p) -> Self::Output

Performs the / operation.

impl<'a> Div for &'a F61p

type Output = F61p

The resulting type after applying the / operator.

fn div(self, rhs: &'a F61p) -> Self::Output

Performs the / operation.

impl Div for F61p

type Output = F61p

The resulting type after applying the / operator.

fn div(self, rhs: F61p) -> Self::Output

Performs the / operation.

impl<'a> DivAssign<&'a F61p> for F61p

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

Performs the /= operation.

impl DivAssign for F61p

fn div_assign(&mut self, rhs: F61p)

Performs the /= operation.

impl FiniteField for F61p

type PrimeField = F61p

The prime-order subfield of the finite field.

const GENERATOR: Self = _

The generator for the multiplicative group.

fn polynomial_modulus() -> Polynomial<Self::PrimeField>

Multiplication over field elements should be reduced over this polynomial.

type NumberOfBitsInBitDecomposition = UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B1>, B1>, B1>, B0>, B1>

The number of bits in the bit decomposition of any element of this finite field.

fn bit_decomposition( &self ) -> GenericArray<bool, Self::NumberOfBitsInBitDecomposition>

Decompose the given field element into bits.

fn inverse(&self) -> Self

Compute the multiplicative inverse of self.

fn decompose<T: FiniteField + IsSubFieldOf<Self>>( &self ) -> GenericArray<T, DegreeModulo<T, Self>>

Decompose self into an array of T elements where T is a subfield of Self.

fn from_subfield<T: FiniteField + IsSubFieldOf<Self>>( arr: &GenericArray<T, DegreeModulo<T, Self>> ) -> Self

Create a field element from an array of subfield T elements.

impl FiniteRing for F61p

fn from_uniform_bytes(x: &[u8; 16]) -> Self

This has a 2^-61 probability of being a biased draw.

fn random<R: RngCore + ?Sized>(rng: &mut R) -> Self

This has a 2^-61 probability of being a biased draw.

const ZERO: Self = _

The additive identity element.

const ONE: Self = _

The multiplicative identity element.

fn random_nonzero<R: Rng + ?Sized>(rng: &mut R) -> Self

Generate a random non-zero element.

fn pow(&self, n: u128) -> Self

Compute self to the power of n.

fn pow_bounded(&self, n: u128, bound: u16) -> Self

Compute self to the power of n, where n is guaranteed to be <= 2^bound.

fn pow_var_time(&self, n: u128) -> Self

Compute self to the power of n, in non-constant time.

impl Hash for F61p

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<'a> Mul<&'a F61p> for F61p

type Output = F61p

The resulting type after applying the * operator.

fn mul(self, rhs: &'a F61p) -> Self::Output

Performs the * operation.

impl<'a> Mul<F61p> for &'a F61p

type Output = F61p

The resulting type after applying the * operator.

fn mul(self, rhs: F61p) -> Self::Output

Performs the * operation.

impl<'a> Mul for &'a F61p

type Output = F61p

The resulting type after applying the * operator.

fn mul(self, rhs: &'a F61p) -> Self::Output

Performs the * operation.

impl Mul for F61p

type Output = F61p

The resulting type after applying the * operator.

fn mul(self, rhs: F61p) -> Self::Output

Performs the * operation.

impl MulAssign<&F61p> for F61p

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

Performs the *= operation.

impl MulAssign for F61p

fn mul_assign(&mut self, rhs: F61p)

Performs the *= operation.

impl Neg for F61p

type Output = F61p

The resulting type after applying the - operator.

fn neg(self) -> Self::Output

Performs the unary - operation.

impl One for F61p

fn one() -> Self

Returns the multiplicative identity element of Self, 1.

fn is_one(&self) -> bool

Returns true if self is equal to the multiplicative identity.

fn set_one(&mut self)

Sets self to the multiplicative identity element of Self, 1.

impl PartialEq for F61p

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Product for F61p

fn product<I: Iterator<Item = Self>>(iter: I) -> Self

Method which takes an iterator and generates Self from the elements by multiplying the items.

impl Serialize for F61p

fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error>

Serialize this value into the given Serde serializer.

impl<'a> Sub<&'a F61p> for F61p

type Output = F61p

The resulting type after applying the - operator.

fn sub(self, rhs: &'a F61p) -> Self::Output

Performs the - operation.

impl<'a> Sub<F61p> for &'a F61p

type Output = F61p

The resulting type after applying the - operator.

fn sub(self, rhs: F61p) -> Self::Output

Performs the - operation.

impl<'a> Sub for &'a F61p

type Output = F61p

The resulting type after applying the - operator.

fn sub(self, rhs: &'a F61p) -> Self::Output

Performs the - operation.

impl Sub for F61p

type Output = F61p

The resulting type after applying the - operator.

fn sub(self, rhs: F61p) -> Self::Output

Performs the - operation.

impl SubAssign<&F61p> for F61p

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

Performs the -= operation.

impl SubAssign for F61p

fn sub_assign(&mut self, rhs: F61p)

Performs the -= operation.

impl Sum for F61p

fn sum<I: Iterator<Item = Self>>(iter: I) -> Self

Method which takes an iterator and generates Self from the elements by “summing up” the items.

impl TryFrom<u128> for F61p

type Error = BiggerThanModulus

The type returned in the event of a conversion error.

fn try_from(value: u128) -> Result<Self, Self::Error>

Performs the conversion.

impl Zero for F61p

fn zero() -> Self

Returns the additive identity element of Self, 0.

fn is_zero(&self) -> bool

Returns true if self is equal to the additive identity.

fn set_zero(&mut self)

Sets self to the additive identity element of Self, 0.

impl Copy for F61p

impl Eq for F61p

impl PrimeFiniteField for F61p