Struct Fn 

pub struct Fn(pub [u64; 6]);

The P-384 scalar ring, Z/nZ where n is the order of the base point.

Values are held in Montgomery form (a * R mod m). Arithmetic is branch-free and carries no data-dependent memory access.

Tuple Fields

0: [u64; 6]

Implementations

impl Fn

pub const MODULUS: [u64; 6]

The modulus, as little-endian 64-bit limbs.

pub fn to_mont(limbs: [u64; 6]) -> Self

Convert a plain integer into Montgomery form, in constant time.

pub const fn to_mont_const(limbs: [u64; 6]) -> Self

Self::to_mont for a curve constant, evaluated at compile time. Not for secrets: it skips the barrier to_mont has.

pub fn from_mont(&self) -> [u64; 6]

Convert out of Montgomery form, in constant time.

pub fn square_n(&self, n: usize) -> Self

Repeated squaring, self^(2^n).

pub fn pow(&self, exponent: &[u64; 6]) -> Self

Exponentiation by a public exponent, square-and-multiply.

The exponent is always a fixed constant here (m - 2 for inversion, (p + 1) / 4 for square roots), so branching on its bits leaks nothing; the base stays secret throughout.

Trait Implementations

impl Clone for Fn

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Fn

impl Debug for Fn

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

Formats the value using the given formatter.

impl Eq for Fn

impl PartialEq for Fn

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Fn