Struct scuttlebutt::field::F64b
source · pub struct F64b(/* private fields */);
Expand description
An element of the finite field $\textsf{GF}({2^{64}})
$ reduced over $x^{64} + x^{19} + x^{16} + x + 1
$.
Trait Implementations§
source§impl<'a> AddAssign<&'a F64b> for F64b
impl<'a> AddAssign<&'a F64b> for F64b
source§fn add_assign(&mut self, rhs: &'a Self)
fn add_assign(&mut self, rhs: &'a Self)
Performs the
+=
operation. Read moresource§impl AddAssign for F64b
impl AddAssign for F64b
source§fn add_assign(&mut self, rhs: F64b)
fn add_assign(&mut self, rhs: F64b)
Performs the
+=
operation. Read moresource§impl CanonicalSerialize for F64b
impl CanonicalSerialize for F64b
§type ByteReprLen = UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>
type ByteReprLen = UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>
The number of bytes in the byte representation for this element.
§type FromBytesError = BytesDeserializationCannotFail
type FromBytesError = BytesDeserializationCannotFail
The error that can result from trying to decode an invalid byte sequence.
§type Serializer = ByteElementSerializer<F64b>
type Serializer = ByteElementSerializer<F64b>
A way to serialize field elements of this type. Read more
§type Deserializer = ByteElementDeserializer<F64b>
type Deserializer = ByteElementDeserializer<F64b>
A way to deserialize field elements of this type. Read more
source§fn from_bytes(
bytes: &GenericArray<u8, Self::ByteReprLen>
) -> Result<Self, Self::FromBytesError>
fn from_bytes( bytes: &GenericArray<u8, Self::ByteReprLen> ) -> Result<Self, Self::FromBytesError>
Deserialize an element from a byte array. Read more
source§impl ConditionallySelectable for F64b
impl ConditionallySelectable for F64b
source§impl ConstantTimeEq for F64b
impl ConstantTimeEq for F64b
source§impl<'de> Deserialize<'de> for F64b
impl<'de> Deserialize<'de> for F64b
source§fn deserialize<D: Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error>
fn deserialize<D: Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error>
Deserialize this value from the given Serde deserializer. Read more
source§impl Distribution<F64b> for Standard
impl Distribution<F64b> for Standard
source§impl<'a> DivAssign<&'a F64b> for F64b
impl<'a> DivAssign<&'a F64b> for F64b
source§fn div_assign(&mut self, rhs: &Self)
fn div_assign(&mut self, rhs: &Self)
Performs the
/=
operation. Read moresource§impl DivAssign for F64b
impl DivAssign for F64b
source§fn div_assign(&mut self, rhs: F64b)
fn div_assign(&mut self, rhs: F64b)
Performs the
/=
operation. Read moresource§impl FiniteField for F64b
impl FiniteField for F64b
§type PrimeField = F2
type PrimeField = F2
The prime-order subfield of the finite field.
source§fn polynomial_modulus() -> Polynomial<Self::PrimeField>
fn polynomial_modulus() -> Polynomial<Self::PrimeField>
Multiplication over field elements should be reduced over this polynomial.
§type NumberOfBitsInBitDecomposition = UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B0>, B0>, B0>
type NumberOfBitsInBitDecomposition = UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B0>, B0>, B0>
The number of bits in the bit decomposition of any element of this finite field. Read more
source§fn bit_decomposition(
&self
) -> GenericArray<bool, Self::NumberOfBitsInBitDecomposition>
fn bit_decomposition( &self ) -> GenericArray<bool, Self::NumberOfBitsInBitDecomposition>
Decompose the given field element into bits. Read more
source§fn decompose<T: FiniteField + IsSubFieldOf<Self>>(
&self
) -> GenericArray<T, DegreeModulo<T, Self>>
fn decompose<T: FiniteField + IsSubFieldOf<Self>>( &self ) -> GenericArray<T, DegreeModulo<T, Self>>
source§fn from_subfield<T: FiniteField + IsSubFieldOf<Self>>(
arr: &GenericArray<T, DegreeModulo<T, Self>>
) -> 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. Read moresource§impl FiniteRing for F64b
impl FiniteRing for F64b
source§fn from_uniform_bytes(x: &[u8; 16]) -> Self
fn from_uniform_bytes(x: &[u8; 16]) -> Self
Construct an element from the given uniformly chosen random bytes.
source§fn pow_bounded(&self, n: u128, bound: u16) -> Self
fn pow_bounded(&self, n: u128, bound: u16) -> Self
source§fn pow_var_time(&self, n: u128) -> Self
fn pow_var_time(&self, n: u128) -> Self
Compute
self
to the power of n
, in non-constant time.source§impl From<u64> for F64b
impl From<u64> for F64b
This conversion treats the $i
$-th bit of the input number as the $i
$-th coefficient of
a polynomial. This polynomial form is then converted into the F64b
.
source§impl IsSubFieldOf<F64b> for F2
impl IsSubFieldOf<F64b> for F2
§type DegreeModulo = UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B0>, B0>, B0>
type DegreeModulo = UInt<UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B0>, B0>, B0>
The value $
n
$ from above.source§fn decompose_superfield(fe: &F64b) -> GenericArray<Self, Self::DegreeModulo>
fn decompose_superfield(fe: &F64b) -> GenericArray<Self, Self::DegreeModulo>
Turn
FE
into an array of Self
, a subfield of FE
.source§fn form_superfield(components: &GenericArray<Self, Self::DegreeModulo>) -> F64b
fn form_superfield(components: &GenericArray<Self, Self::DegreeModulo>) -> F64b
Homomorphically lift an array of
Self
into an FE
.source§impl<'a> MulAssign<&'a F64b> for F64b
impl<'a> MulAssign<&'a F64b> for F64b
source§fn mul_assign(&mut self, rhs: &'a Self)
fn mul_assign(&mut self, rhs: &'a Self)
Performs the
*=
operation. Read moresource§impl MulAssign for F64b
impl MulAssign for F64b
source§fn mul_assign(&mut self, rhs: F64b)
fn mul_assign(&mut self, rhs: F64b)
Performs the
*=
operation. Read moresource§impl PartialEq for F64b
impl PartialEq for F64b
source§impl<'a> SubAssign<&'a F64b> for F64b
impl<'a> SubAssign<&'a F64b> for F64b
source§fn sub_assign(&mut self, rhs: &'a Self)
fn sub_assign(&mut self, rhs: &'a Self)
Performs the
-=
operation. Read moresource§impl SubAssign for F64b
impl SubAssign for F64b
source§fn sub_assign(&mut self, rhs: F64b)
fn sub_assign(&mut self, rhs: F64b)
Performs the
-=
operation. Read moreimpl Copy for F64b
impl Eq for F64b
impl IsSubRingOf<F64b> for F2
Auto Trait Implementations§
impl Freeze for F64b
impl RefUnwindSafe for F64b
impl Send for F64b
impl Sync for F64b
impl Unpin for F64b
impl UnwindSafe for F64b
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<FE> IsSubFieldOf<FE> for FEwhere
FE: FiniteField,
impl<FE> IsSubFieldOf<FE> for FEwhere
FE: FiniteField,
§type DegreeModulo = UInt<UTerm, B1>
type DegreeModulo = UInt<UTerm, B1>
The value $
n
$ from above.source§fn decompose_superfield(
fe: &FE
) -> GenericArray<FE, <FE as IsSubFieldOf<FE>>::DegreeModulo>
fn decompose_superfield( fe: &FE ) -> GenericArray<FE, <FE as IsSubFieldOf<FE>>::DegreeModulo>
Turn
FE
into an array of Self
, a subfield of FE
.source§fn form_superfield(
components: &GenericArray<FE, <FE as IsSubFieldOf<FE>>::DegreeModulo>
) -> FE
fn form_superfield( components: &GenericArray<FE, <FE as IsSubFieldOf<FE>>::DegreeModulo> ) -> FE
Homomorphically lift an array of
Self
into an FE
.