Struct RustCryptoScalar

pub struct RustCryptoScalar<E: CurveArithmetic>(pub E::Scalar);

Available on crate feature rust-crypto only.

Scalar wrapper

Tuple Fields

0: E::Scalar

Trait Implementations

impl<E: CurveArithmetic> Additive for RustCryptoScalar<E>

fn add(a: &Self, b: &Self) -> Self

Computes a + b

fn sub(a: &Self, b: &Self) -> Self

Computes a - b

fn negate(x: &Self) -> Self

Computes -a

fn double(x: &Self) -> Self

where Self: Sized,

Takes x, returns x + x

impl<E: CurveArithmetic> Clone for RustCryptoScalar<E>

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<E> ConditionallySelectable for RustCryptoScalar<E>

where E: CurveArithmetic, E::Scalar: ConditionallySelectable,

fn conditional_select(a: &Self, b: &Self, choice: Choice) -> Self

Select a or b according to choice.

fn conditional_assign(&mut self, other: &Self, choice: Choice)

Conditionally assign other to self, according to choice.

fn conditional_swap(a: &mut Self, b: &mut Self, choice: Choice)

Conditionally swap self and other if choice == 1; otherwise, reassign both unto themselves.

impl<E> ConstantTimeEq for RustCryptoScalar<E>

where E: CurveArithmetic, E::Scalar: ConstantTimeEq,

fn ct_eq(&self, other: &Self) -> Choice

Determine if two items are equal.

fn ct_ne(&self, other: &Self) -> Choice

Determine if two items are NOT equal.

impl<E: CurveArithmetic> Default for RustCryptoScalar<E>

fn default() -> Self

Returns the “default value” for a type.

impl<E: CurveArithmetic + Curve> IntegerEncoding for RustCryptoScalar<E>

where for<'s> ScalarPrimitive<E>: From<&'s E::Scalar>, E::Scalar: Reduce<E::Uint>, Self: BytesModOrder,

type Bytes = GenericArray<u8, <<E as Curve>::Uint as ArrayEncoding>::ByteSize>

Byte array that fits the whole encoded integer

fn to_be_bytes(&self) -> Self::Bytes

Encodes integer as bytes in big-endian byte order

fn to_le_bytes(&self) -> Self::Bytes

Encodes integer as bytes in little-endian byte order

fn from_be_bytes_exact(bytes: &Self::Bytes) -> Option<Self>

Decodes integer encoded as bytes in big-endian bytes order

fn from_le_bytes_exact(bytes: &Self::Bytes) -> Option<Self>

Decodes integer encoded as bytes in little-endian bytes order

fn from_be_bytes_mod_order(bytes: &[u8]) -> Self

Interprets bytes as big-endian encoding of an integer. Returns integer mod curve (prime) order.

fn from_le_bytes_mod_order(bytes: &[u8]) -> Self

Interprets bytes as little-endian encoding of an integer. Returns integer mod curve (prime) order.

impl<E: CurveArithmetic> Invertible for RustCryptoScalar<E>

fn invert(x: &Self) -> CtOption<Self>

Inverts $x$, returns $x^{-1}$ such that $x \cdot x^{-1} = 1$

impl<E> Multiplicative<CurveGenerator> for RustCryptoScalar<E>

where E: CurveArithmetic, for<'a> &'a E::ProjectivePoint: Mul<&'a E::Scalar, Output = E::ProjectivePoint>,

type Output = RustCryptoPoint<E>

Type of multiplication output

fn mul(a: &Self, _b: &CurveGenerator) -> Self::Output

Computes a * b

impl<E> Multiplicative<RustCryptoPoint<E>> for RustCryptoScalar<E>

where E: CurveArithmetic, for<'a> &'a E::ProjectivePoint: Mul<&'a E::Scalar, Output = E::ProjectivePoint>,

type Output = RustCryptoPoint<E>

Type of multiplication output

fn mul(a: &Self, b: &RustCryptoPoint<E>) -> Self::Output

Computes a * b

impl<E: CurveArithmetic> Multiplicative<RustCryptoScalar<E>> for RustCryptoScalar<E>

type Output = RustCryptoScalar<E>

Type of multiplication output

fn mul(a: &Self, b: &RustCryptoScalar<E>) -> Self::Output

Computes a * b

impl<E: CurveArithmetic> One for RustCryptoScalar<E>

fn one() -> Self

Constructs one value of Self

fn is_one(x: &Self) -> Choice

Checks (in constant-time) if x is one

impl<E> PartialEq for RustCryptoScalar<E>

where E: CurveArithmetic, E::Scalar: PartialEq,

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<E: CurveArithmetic + Curve> Reduce<32> for RustCryptoScalar<E>

where E::Scalar: Reduce<U256>,

fn from_be_array_mod_order(bytes: &[u8; 32]) -> Self

Interprets bytes as big-endian encoding of an integer, returns this integer modulo curve (prime) order

fn from_le_array_mod_order(bytes: &[u8; 32]) -> Self

Interprets bytes as little-endian encoding of an integer, returns this integer modulo curve (prime) order

impl<E: CurveArithmetic + Curve> Reduce<64> for RustCryptoScalar<E>

where E::Scalar: Reduce<U512>,

fn from_be_array_mod_order(bytes: &[u8; 64]) -> Self

Interprets bytes as big-endian encoding of an integer, returns this integer modulo curve (prime) order

fn from_le_array_mod_order(bytes: &[u8; 64]) -> Self

Interprets bytes as little-endian encoding of an integer, returns this integer modulo curve (prime) order

impl<E: CurveArithmetic> Samplable for RustCryptoScalar<E>

fn random<R: RngCore>(rng: &mut R) -> Self

Uniformely samples a random value of Self

impl<E: CurveArithmetic> Zero for RustCryptoScalar<E>

fn zero() -> Self

Constructs zero value of Self

fn is_zero(x: &Self) -> Choice

Checks (in constant-time) if x is zero

impl<E: CurveArithmetic> Copy for RustCryptoScalar<E>

impl<E> DefaultIsZeroes for RustCryptoScalar<E>

where E: CurveArithmetic, E::Scalar: DefaultIsZeroes,

impl<E> Eq for RustCryptoScalar<E>

where E: CurveArithmetic, E::Scalar: Eq,