[−][src]Trait fawkes_crypto_pairing_ce::PrimeField
This represents an element of a prime field.
Associated Types
type Repr: PrimeFieldRepr + From<Self>
The prime field can be converted back and forth into this biginteger representation.
Associated Constants
const NUM_BITS: u32
How many bits are needed to represent an element of this field.
const CAPACITY: u32
How many bits of information can be reliably stored in the field element.
const S: u32
2^s * t = char()
- 1 with t odd.
Required methods
fn from_repr(repr: Self::Repr) -> Result<Self, PrimeFieldDecodingError>
Convert this prime field element into a biginteger representation.
fn from_raw_repr(repr: Self::Repr) -> Result<Self, PrimeFieldDecodingError>
Creates an element from raw representation in Montgommery form.
fn into_repr(&self) -> Self::Repr
Convert a biginteger representation into a prime field element, if the number is an element of the field.
fn into_raw_repr(&self) -> Self::Repr
Expose Montgommery represendation.
fn char() -> Self::Repr
Returns the field characteristic; the modulus.
fn multiplicative_generator() -> Self
Returns the multiplicative generator of char()
- 1 order. This element
must also be quadratic nonresidue.
fn root_of_unity() -> Self
Returns the 2^s root of unity computed by exponentiating the multiplicative_generator()
by t.
Provided methods
fn from_str(s: &str) -> Option<Self>
Interpret a string of numbers as a (congruent) prime field element. Does not accept unnecessary leading zeroes or a blank string.