Struct Scalar 

pub struct Scalar(/* private fields */);

P-521 scalar value for use in elliptic curve operations. Represents integers modulo the curve order n. Used for private keys and scalar multiplication. Automatically zeroized on drop for security.

Implementations

impl Scalar

pub fn new(data: [u8; 66]) -> Result<Self>

Create a scalar from raw bytes with modular reduction. Ensures the scalar is in the valid range [1, n-1] where n is the curve order. Performs modular reduction if the input is >= n. Returns an error if the result would be zero (invalid for cryptographic use).

pub fn from_secret_buffer( buffer: SecretBuffer<P521_SCALAR_SIZE>, ) -> Result<Self>

Create a scalar from an existing SecretBuffer. Performs the same validation and reduction as new() but starts from a SecretBuffer instead of a raw byte array.

pub fn as_secret_buffer(&self) -> &SecretBuffer<P521_SCALAR_SIZE>

Access the underlying SecretBuffer containing the scalar value

pub fn serialize(&self) -> [u8; 66]

Serialize the scalar to a byte array. Returns the scalar in big-endian byte representation. The output is suitable for storage or transmission.

pub fn deserialize(bytes: &[u8]) -> Result<Self>

Deserialize a scalar from bytes with validation. Parses bytes as a big-endian scalar value and ensures it’s in the valid range for P-521 operations.

pub fn is_zero(&self) -> bool

Check if the scalar represents zero. Constant-time check to determine if the scalar is the additive identity (which is invalid for most cryptographic operations).

pub fn add_mod_n(&self, other: &Self) -> Result<Self>

Add two scalars modulo the curve order n

pub fn sub_mod_n(&self, other: &Self) -> Result<Self>

Subtract two scalars modulo the curve order n

pub fn mul_mod_n(&self, other: &Self) -> Result<Self>

Multiply two scalars modulo the curve order n. Uses constant-time double-and-add algorithm for correctness and security. Processes bits from MSB to LSB to ensure correct powers of 2.

pub fn inv_mod_n(&self) -> Result<Self>

Compute multiplicative inverse modulo n using Fermat’s little theorem a^(-1) ≡ a^(n-2) (mod n). Left-to-right binary exponentiation.

pub fn negate(&self) -> Self

Compute the additive inverse (negation) modulo n Returns -self mod n, which is equivalent to n - self when self != 0 Returns 0 when self is 0

Trait Implementations

impl Clone for Scalar

fn clone(&self) -> Scalar

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Scalar

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

Formats the value using the given formatter.

impl Drop for Scalar

fn drop(&mut self)

Executes the destructor for this type.

impl Zeroize for Scalar

fn zeroize(&mut self)

Zero out this object from memory using Rust intrinsics which ensure the zeroization operation is not “optimized away” by the compiler.