Struct gridiron::fp_256::Fp256

pub struct Fp256 { /* fields omitted */ }

Methods

impl Fp256

pub fn to_monty(self) -> Monty

pub fn normalize_assign_little(&mut self)

See normalize_little_limbs.

pub fn normalize_little_limbs(limbs: [u32; 9]) -> [u32; 9]

This normalize should only be used when the input is at most 2*p-1.

pub fn normalize_little(self) -> Self

See normalize_little_limbs.

pub fn to_bytes_array(&self) -> [u8; 32]

Convert the value to a byte array which is PRIMEBYTES long. Ported from BearSSL br_i31_encode.

pub fn new(digits: [u32; 9]) -> Fp256

Create a new instance given the raw limbs form. Note that this is least significant bit first.

pub fn to_str_hex(&self) -> String

Important traits for FpBitIter<'a, Fp256>

impl<'a> Iterator for FpBitIter<'a, Fp256> type Item = ConstantBool<u32>;

pub fn iter_bit(&self) -> FpBitIter<Fp256>

Trait Implementations

impl ConstantSwap for Fp256

fn swap_if(&mut self, other: &mut Fp256, swap: ConstantBool<u32>)

Swaps this with other if the value was true

impl Eq for Fp256

impl Clone for Fp256

fn clone(&self) -> Fp256

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Copy for Fp256

impl PartialOrd<Fp256> for Fp256

fn partial_cmp(&self, other: &Fp256) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

#[must_use]

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

This method tests less than (for self and other) and is used by the < operator.

#[must_use]

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

#[must_use]

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

This method tests greater than (for self and other) and is used by the > operator.

#[must_use]

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl PartialEq<Fp256> for Fp256

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

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

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

This method tests for !=.

impl Default for Fp256

fn default() -> Self

Returns the "default value" for a type.

impl Ord for Fp256

fn cmp(&self, other: &Fp256) -> Ordering

This method returns an Ordering between self and other.

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

Compares and returns the maximum of two values.

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

Compares and returns the minimum of two values.

impl From<u8> for Fp256

fn from(src: u8) -> Self

Performs the conversion.

impl From<u32> for Fp256

fn from(src: u32) -> Self

Performs the conversion.

impl From<u64> for Fp256

fn from(src: u64) -> Self

Performs the conversion.

impl From<[u8; 32]> for Fp256

Assume element zero is most sig

fn from(src: [u8; 32]) -> Self

Performs the conversion.

impl From<[u8; 64]> for Fp256

fn from(src: [u8; 64]) -> Self

Performs the conversion.

impl Add<Fp256> for Fp256

type Output = Fp256

The resulting type after applying the + operator.

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

Performs the + operation.

impl Sub<Fp256> for Fp256

type Output = Fp256

The resulting type after applying the - operator.

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

Performs the - operation.

impl Mul<Fp256> for Fp256

type Output = Fp256

The resulting type after applying the * operator.

fn mul(self, rhs: Fp256) -> Fp256

Performs the * operation.

impl Mul<u32> for Fp256

Note that this reveals the u32, but nothing else. It's expected that the u32 is not secret. If it is, you can use Mul<$classname>

type Output = Fp256

The resulting type after applying the * operator.

fn mul(self, rhs: u32) -> Fp256

Performs the * operation.

impl Mul<Fp256> for Monty

type Output = Fp256

The resulting type after applying the * operator.

fn mul(self, rhs: Fp256) -> Fp256

Performs the * operation.

impl Mul<Monty> for Fp256

type Output = Fp256

The resulting type after applying the * operator.

fn mul(self, rhs: Monty) -> Fp256

Performs the * operation.

impl Div<Fp256> for Fp256

type Output = Fp256

The resulting type after applying the / operator.

fn div(self, rhs: Fp256) -> Fp256

Performs the / operation.

impl Neg for Fp256

type Output = Fp256

The resulting type after applying the - operator.

fn neg(self) -> Fp256

Performs the unary - operation.

impl AddAssign<Fp256> for Fp256

fn add_assign(&mut self, other: Fp256)

Performs the += operation.

impl SubAssign<Fp256> for Fp256

fn sub_assign(&mut self, other: Fp256)

Performs the -= operation.

impl MulAssign<Fp256> for Fp256

Note that this uses a conversion to montgomery form and then multiplies by the other value to get back out. This takes less time than just doing the multiplication and doing a reduction.

fn mul_assign(&mut self, rhs: Fp256)

Performs the *= operation.

impl Debug for Fp256

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

Formats the value using the given formatter.

impl LowerHex for Fp256

Prints the hex value of the number in big endian (most significant digit on the left and least on the right) to make debugging easier.

fn fmt(&self, fmtr: &mut Formatter) -> Result<(), Error>

Formats the value using the given formatter.

impl Zero for Fp256

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.

impl One for Fp256

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.

impl Inv for Fp256

type Output = Fp256

The result after applying the operator.

fn inv(self) -> Fp256

Returns the multiplicative inverse of self.

impl Pow<u32> for Fp256

Reveals the exponent. If you need constant time, use Pow<$classname>

type Output = Fp256

The result after applying the operator.

fn pow(self, rhs: u32) -> Fp256

Returns self to the power rhs.

impl Pow<Fp256> for Fp256

type Output = Fp256

The result after applying the operator.

fn pow(self, rhs: Fp256) -> Fp256

14.94 Algorithm Montgomery exponentiation in Handbook of Applied Crypto INPUT:m=(ml−1···m0)b,R=bl,m′ =−m−1 modb,e=(et···e0)2 withet =1, and an integer x, 1 ≤ x < m. OUTPUT: xe mod m.

1. x􏰁← Mont(x,R2 mod m), A←R mod m. (R mod m and R2 mod m may be pro-ided as inputs.)
2. For i from t down to 0 do the following: 2.1 A←Mont(A,A). 2.2 If ei = 1 then A← Mont(A, x􏰁).
3. A←Mont(A,1).
4. Return(A).