Trait ff::PrimeField [−][src]
pub trait PrimeField: Field + From<u64> { type Repr: Default + AsRef<[u8]> + AsMut<[u8]>; const NUM_BITS: u32; const CAPACITY: u32; const S: u32; fn from_repr(_: Self::Repr) -> Option<Self>; fn to_repr(&self) -> Self::Repr; fn is_odd(&self) -> bool; fn multiplicative_generator() -> Self; fn root_of_unity() -> Self; fn from_str(s: &str) -> Option<Self> { ... } fn is_even(&self) -> bool { ... } }
Expand description
This represents an element of a prime field.
Associated Types
Associated Constants
Required methods
fn from_repr(_: Self::Repr) -> Option<Self>
[src]
fn from_repr(_: Self::Repr) -> Option<Self>
[src]Attempts to convert a byte representation of a field element into an element of this prime field, failing if the input is not canonical (is not smaller than the field’s modulus).
The byte representation is interpreted with the same endianness as elements
returned by PrimeField::to_repr
.
fn to_repr(&self) -> Self::Repr
[src]
fn to_repr(&self) -> Self::Repr
[src]Converts an element of the prime field into the standard byte representation for this field.
The endianness of the byte representation is implementation-specific. Generic encodings of field elements should be treated as opaque.
fn multiplicative_generator() -> Self
[src]
fn multiplicative_generator() -> Self
[src]Returns a fixed multiplicative generator of modulus - 1
order. This element must
also be a quadratic nonresidue.
It can be calculated using SageMath as GF(modulus).primitive_element()
.
Implementations of this method MUST ensure that this is the generator used to
derive Self::root_of_unity
.
fn root_of_unity() -> Self
[src]
fn root_of_unity() -> Self
[src]Returns the 2^s
root of unity.
It can be calculated by exponentiating Self::multiplicative_generator
by t
,
where t = (modulus - 1) >> Self::S
.