[−][src]Struct p256::Scalar
This is supported on crate feature
arithmetic only.An element in the finite field modulo n.
Implementations
impl Scalar[src]
pub const fn zero() -> Scalar[src]
Returns the zero scalar.
pub const fn one() -> Scalar[src]
Returns the multiplicative identity.
pub fn from_bytes_reduced(bytes: &FieldBytes) -> Self[src]
Parses the given byte array as a scalar.
Subtracts the modulus when the byte array is larger than the modulus.
pub fn to_bytes(&self) -> FieldBytes[src]
Returns the SEC1 encoding of this scalar.
pub fn is_zero(&self) -> Choice[src]
pub const fn add(&self, rhs: &Self) -> Self[src]
Returns self + rhs mod n
pub const fn double(&self) -> Self[src]
Returns 2*self.
pub const fn subtract(&self, rhs: &Self) -> Self[src]
Returns self - rhs mod n
pub const fn mul(&self, rhs: &Self) -> Self[src]
Returns self * rhs mod n
pub const fn square(&self) -> Self[src]
Returns self * self mod p
pub fn pow_vartime(&self, by: &[u64; 4]) -> Self[src]
Returns self^by, where by is a little-endian integer exponent.
This operation is variable time with respect to the exponent. If the exponent is fixed, this operation is effectively constant time.
pub fn invert(&self) -> CtOption<Self>[src]
Returns the multiplicative inverse of self, if self is non-zero
pub fn is_odd(&self) -> Choice[src]
Is integer representing equivalence class odd
pub fn is_even(&self) -> Choice[src]
Is integer representing equivalence class even
pub fn invert_vartime(&self) -> CtOption<Self>[src]
Faster inversion using Stein's algorithm
Trait Implementations
impl Add<&'_ Scalar> for &Scalar[src]
type Output = Scalar
The resulting type after applying the + operator.
pub fn add(self, other: &Scalar) -> Scalar[src]
impl Add<&'_ Scalar> for Scalar[src]
type Output = Scalar
The resulting type after applying the + operator.
pub fn add(self, other: &Scalar) -> Scalar[src]
impl Add<Scalar> for Scalar[src]
type Output = Scalar
The resulting type after applying the + operator.
pub fn add(self, other: Scalar) -> Scalar[src]
impl AddAssign<&'_ Scalar> for Scalar[src]
pub fn add_assign(&mut self, rhs: &Scalar)[src]
impl AddAssign<Scalar> for Scalar[src]
pub fn add_assign(&mut self, rhs: Scalar)[src]
impl Borrow<Scalar> for BlindedScalar[src]
impl Clone for Scalar[src]
impl ConditionallySelectable for Scalar[src]
pub fn conditional_select(a: &Self, b: &Self, choice: Choice) -> Self[src]
pub fn conditional_assign(&mut self, other: &Self, choice: Choice)[src]
pub fn conditional_swap(a: &mut Self, b: &mut Self, choice: Choice)[src]
impl ConstantTimeEq for Scalar[src]
impl Copy for Scalar[src]
impl Debug for Scalar[src]
impl Default for Scalar[src]
impl Eq for Scalar[src]
impl Field for Scalar[src]
pub fn random(mut rng: impl RngCore) -> Self[src]
pub fn zero() -> Self[src]
pub fn one() -> Self[src]
pub fn is_zero(&self) -> bool[src]
#[must_use]pub fn square(&self) -> Self[src]
#[must_use]pub fn double(&self) -> Self[src]
pub fn invert(&self) -> CtOption<Self>[src]
pub fn sqrt(&self) -> CtOption<Self>[src]
#[must_use]pub fn cube(&self) -> Self
pub fn pow_vartime<S>(&self, exp: S) -> Self where
S: AsRef<[u64]>,
S: AsRef<[u64]>,
impl From<&'_ Scalar> for ScalarBits[src]
pub fn from(scalar: &Scalar) -> ScalarBits[src]
impl From<&'_ Scalar> for FieldBytes[src]
impl From<&'_ SecretKey<NistP256>> for Scalar[src]
impl From<Scalar> for FieldBytes[src]
impl From<u64> for Scalar[src]
impl FromDigest<NistP256> for Scalar[src]
This is supported on crate feature
digest only.pub fn from_digest<D>(digest: D) -> Self where
D: Digest<OutputSize = U32>, [src]
D: Digest<OutputSize = U32>,
Convert the output of a digest algorithm into a Scalar reduced
modulo n.
impl Mul<&'_ Scalar> for &ProjectivePoint[src]
type Output = ProjectivePoint
The resulting type after applying the * operator.
pub fn mul(self, other: &Scalar) -> ProjectivePoint[src]
impl Mul<&'_ Scalar> for ProjectivePoint[src]
type Output = ProjectivePoint
The resulting type after applying the * operator.
pub fn mul(self, other: &Scalar) -> ProjectivePoint[src]
impl Mul<&'_ Scalar> for &Scalar[src]
type Output = Scalar
The resulting type after applying the * operator.
pub fn mul(self, other: &Scalar) -> Scalar[src]
impl Mul<&'_ Scalar> for Scalar[src]
type Output = Scalar
The resulting type after applying the * operator.
pub fn mul(self, other: &Scalar) -> Scalar[src]
impl Mul<Scalar> for ProjectivePoint[src]
type Output = ProjectivePoint
The resulting type after applying the * operator.
pub fn mul(self, other: Scalar) -> ProjectivePoint[src]
impl Mul<Scalar> for Scalar[src]
type Output = Scalar
The resulting type after applying the * operator.
pub fn mul(self, other: Scalar) -> Scalar[src]
impl MulAssign<&'_ Scalar> for ProjectivePoint[src]
pub fn mul_assign(&mut self, rhs: &Scalar)[src]
impl MulAssign<&'_ Scalar> for Scalar[src]
pub fn mul_assign(&mut self, rhs: &Scalar)[src]
impl MulAssign<Scalar> for ProjectivePoint[src]
pub fn mul_assign(&mut self, rhs: Scalar)[src]
impl MulAssign<Scalar> for Scalar[src]
pub fn mul_assign(&mut self, rhs: Scalar)[src]
impl Neg for Scalar[src]
type Output = Scalar
The resulting type after applying the - operator.
pub fn neg(self) -> Scalar[src]
impl<'a> Neg for &'a Scalar[src]
type Output = Scalar
The resulting type after applying the - operator.
pub fn neg(self) -> Scalar[src]
impl Ord for Scalar[src]
pub fn cmp(&self, other: &Self) -> Ordering[src]
#[must_use]pub fn max(self, other: Self) -> Self1.21.0[src]
#[must_use]pub fn min(self, other: Self) -> Self1.21.0[src]
#[must_use]pub fn clamp(self, min: Self, max: Self) -> Self1.50.0[src]
impl PartialEq<Scalar> for Scalar[src]
pub fn eq(&self, other: &Self) -> bool[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool1.0.0[src]
impl PartialOrd<Scalar> for Scalar[src]
pub fn partial_cmp(&self, other: &Self) -> Option<Ordering>[src]
#[must_use]pub fn lt(&self, other: &Rhs) -> bool1.0.0[src]
#[must_use]pub fn le(&self, other: &Rhs) -> bool1.0.0[src]
#[must_use]pub fn gt(&self, other: &Rhs) -> bool1.0.0[src]
#[must_use]pub fn ge(&self, other: &Rhs) -> bool1.0.0[src]
impl PrimeField for Scalar[src]
type Repr = FieldBytes
The prime field can be converted back and forth into this binary representation. Read more
type ReprBits = [u64; 4]
The backing store for a bit representation of a prime field element.
pub const NUM_BITS: u32[src]
pub const CAPACITY: u32[src]
pub const S: u32[src]
pub fn from_repr(bytes: FieldBytes) -> Option<Self>[src]
Attempts to parse the given byte array as an SEC1-encoded scalar.
Returns None if the byte array does not contain a big-endian integer in the range [0, p).
pub fn to_repr(&self) -> FieldBytes[src]
pub fn to_le_bits(&self) -> ScalarBits[src]
pub fn is_odd(&self) -> bool[src]
pub fn char_le_bits() -> ScalarBits[src]
pub fn multiplicative_generator() -> Self[src]
pub fn root_of_unity() -> Self[src]
pub fn from_str(s: &str) -> Option<Self>
pub fn is_even(&self) -> bool
impl SignPrimitive<NistP256> for Scalar[src]
This is supported on crate feature
ecdsa-core only.pub fn try_sign_prehashed<K>(
&self,
ephemeral_scalar: &K,
z: &Scalar
) -> Result<Signature, Error> where
K: Borrow<Scalar> + Invert<Output = Scalar>, [src]
&self,
ephemeral_scalar: &K,
z: &Scalar
) -> Result<Signature, Error> where
K: Borrow<Scalar> + Invert<Output = Scalar>,
impl Sub<&'_ Scalar> for &Scalar[src]
type Output = Scalar
The resulting type after applying the - operator.
pub fn sub(self, other: &Scalar) -> Scalar[src]
impl Sub<&'_ Scalar> for Scalar[src]
type Output = Scalar
The resulting type after applying the - operator.
pub fn sub(self, other: &Scalar) -> Scalar[src]
impl Sub<Scalar> for Scalar[src]
type Output = Scalar
The resulting type after applying the - operator.
pub fn sub(self, other: Scalar) -> Scalar[src]
impl SubAssign<&'_ Scalar> for Scalar[src]
pub fn sub_assign(&mut self, rhs: &Scalar)[src]
impl SubAssign<Scalar> for Scalar[src]
pub fn sub_assign(&mut self, rhs: Scalar)[src]
impl Zeroize for Scalar[src]
Auto Trait Implementations
impl RefUnwindSafe for Scalar[src]
impl Send for Scalar[src]
impl Sync for Scalar[src]
impl Unpin for Scalar[src]
impl UnwindSafe for Scalar[src]
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized, [src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized, [src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T[src]
impl<T> ConditionallyNegatable for T where
T: ConditionallySelectable,
&'a T: for<'a> Neg,
<&'a T as Neg>::Output == T, [src]
T: ConditionallySelectable,
&'a T: for<'a> Neg,
<&'a T as Neg>::Output == T,
pub fn conditional_negate(&mut self, choice: Choice)[src]
impl<T> Conv for T
impl<T> FmtForward for T
pub fn fmt_binary(self) -> FmtBinary<Self> where
Self: Binary,
Self: Binary,
pub fn fmt_display(self) -> FmtDisplay<Self> where
Self: Display,
Self: Display,
pub fn fmt_lower_exp(self) -> FmtLowerExp<Self> where
Self: LowerExp,
Self: LowerExp,
pub fn fmt_lower_hex(self) -> FmtLowerHex<Self> where
Self: LowerHex,
Self: LowerHex,
pub fn fmt_octal(self) -> FmtOctal<Self> where
Self: Octal,
Self: Octal,
pub fn fmt_pointer(self) -> FmtPointer<Self> where
Self: Pointer,
Self: Pointer,
pub fn fmt_upper_exp(self) -> FmtUpperExp<Self> where
Self: UpperExp,
Self: UpperExp,
pub fn fmt_upper_hex(self) -> FmtUpperHex<Self> where
Self: UpperHex,
Self: UpperHex,
impl<T> From<T> for T[src]
impl<T, Rhs, Output> GroupOps<Rhs, Output> for T where
T: Add<Rhs, Output = Output> + Sub<Rhs, Output = Output> + AddAssign<Rhs> + SubAssign<Rhs>,
T: Add<Rhs, Output = Output> + Sub<Rhs, Output = Output> + AddAssign<Rhs> + SubAssign<Rhs>,
impl<T, Rhs, Output> GroupOpsOwned<Rhs, Output> for T where
T: for<'r> GroupOps<&'r Rhs, Output>,
T: for<'r> GroupOps<&'r Rhs, Output>,
impl<T, U> Into<U> for T where
U: From<T>, [src]
U: From<T>,
impl<F> Invert for F where
F: Field, [src]
F: Field,
impl<T> Pipe for T
impl<T> PipeAsRef for T
pub fn pipe_as_ref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R where
Self: AsRef<T>,
R: 'a,
T: 'a,
Self: AsRef<T>,
R: 'a,
T: 'a,
pub fn pipe_as_mut<'a, T, R>(
&'a mut self,
func: impl FnOnce(&'a mut T) -> R
) -> R where
Self: AsMut<T>,
R: 'a,
T: 'a,
&'a mut self,
func: impl FnOnce(&'a mut T) -> R
) -> R where
Self: AsMut<T>,
R: 'a,
T: 'a,
impl<T> PipeBorrow for T
pub fn pipe_borrow<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R where
Self: Borrow<T>,
R: 'a,
T: 'a,
Self: Borrow<T>,
R: 'a,
T: 'a,
pub fn pipe_borrow_mut<'a, T, R>(
&'a mut self,
func: impl FnOnce(&'a mut T) -> R
) -> R where
Self: BorrowMut<T>,
R: 'a,
T: 'a,
&'a mut self,
func: impl FnOnce(&'a mut T) -> R
) -> R where
Self: BorrowMut<T>,
R: 'a,
T: 'a,
impl<T> PipeDeref for T
pub fn pipe_deref<'a, R>(
&'a self,
func: impl FnOnce(&'a Self::Target) -> R
) -> R where
Self: Deref,
R: 'a,
&'a self,
func: impl FnOnce(&'a Self::Target) -> R
) -> R where
Self: Deref,
R: 'a,
pub fn pipe_deref_mut<'a, R>(
&'a mut self,
func: impl FnOnce(&'a mut Self::Target) -> R
) -> R where
Self: DerefMut,
R: 'a,
&'a mut self,
func: impl FnOnce(&'a mut Self::Target) -> R
) -> R where
Self: DerefMut,
R: 'a,
impl<T> PipeRef for T
pub fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> R where
R: 'a,
R: 'a,
pub fn pipe_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> R where
R: 'a,
R: 'a,
impl<T> Same<T> for T
type Output = T
Should always be Self
impl<T, Rhs, Output> ScalarMul<Rhs, Output> for T where
T: Mul<Rhs, Output = Output> + MulAssign<Rhs>,
T: Mul<Rhs, Output = Output> + MulAssign<Rhs>,
impl<T, Rhs, Output> ScalarMulOwned<Rhs, Output> for T where
T: for<'r> ScalarMul<&'r Rhs, Output>,
T: for<'r> ScalarMul<&'r Rhs, Output>,
impl<T> Tap for T
pub fn tap<F, R>(self, func: F) -> Self where
F: FnOnce(&Self) -> R,
F: FnOnce(&Self) -> R,
pub fn tap_dbg<F, R>(self, func: F) -> Self where
F: FnOnce(&Self) -> R,
F: FnOnce(&Self) -> R,
pub fn tap_mut<F, R>(self, func: F) -> Self where
F: FnOnce(&mut Self) -> R,
F: FnOnce(&mut Self) -> R,
pub fn tap_mut_dbg<F, R>(self, func: F) -> Self where
F: FnOnce(&mut Self) -> R,
F: FnOnce(&mut Self) -> R,
impl<T, U> TapAsRef<U> for T where
U: ?Sized,
U: ?Sized,
pub fn tap_ref<F, R>(self, func: F) -> Self where
Self: AsRef<T>,
F: FnOnce(&T) -> R,
Self: AsRef<T>,
F: FnOnce(&T) -> R,
pub fn tap_ref_dbg<F, R>(self, func: F) -> Self where
Self: AsRef<T>,
F: FnOnce(&T) -> R,
Self: AsRef<T>,
F: FnOnce(&T) -> R,
pub fn tap_ref_mut<F, R>(self, func: F) -> Self where
Self: AsMut<T>,
F: FnOnce(&mut T) -> R,
Self: AsMut<T>,
F: FnOnce(&mut T) -> R,
pub fn tap_ref_mut_dbg<F, R>(self, func: F) -> Self where
Self: AsMut<T>,
F: FnOnce(&mut T) -> R,
Self: AsMut<T>,
F: FnOnce(&mut T) -> R,
impl<T, U> TapBorrow<U> for T where
U: ?Sized,
U: ?Sized,
pub fn tap_borrow<F, R>(self, func: F) -> Self where
Self: Borrow<T>,
F: FnOnce(&T) -> R,
Self: Borrow<T>,
F: FnOnce(&T) -> R,
pub fn tap_borrow_dbg<F, R>(self, func: F) -> Self where
Self: Borrow<T>,
F: FnOnce(&T) -> R,
Self: Borrow<T>,
F: FnOnce(&T) -> R,
pub fn tap_borrow_mut<F, R>(self, func: F) -> Self where
Self: BorrowMut<T>,
F: FnOnce(&mut T) -> R,
Self: BorrowMut<T>,
F: FnOnce(&mut T) -> R,
pub fn tap_borrow_mut_dbg<F, R>(self, func: F) -> Self where
Self: BorrowMut<T>,
F: FnOnce(&mut T) -> R,
Self: BorrowMut<T>,
F: FnOnce(&mut T) -> R,
impl<T> TapDeref for T
pub fn tap_deref<F, R>(self, func: F) -> Self where
Self: Deref,
F: FnOnce(&Self::Target) -> R,
Self: Deref,
F: FnOnce(&Self::Target) -> R,
pub fn tap_deref_dbg<F, R>(self, func: F) -> Self where
Self: Deref,
F: FnOnce(&Self::Target) -> R,
Self: Deref,
F: FnOnce(&Self::Target) -> R,
pub fn tap_deref_mut<F, R>(self, func: F) -> Self where
Self: DerefMut,
F: FnOnce(&mut Self::Target) -> R,
Self: DerefMut,
F: FnOnce(&mut Self::Target) -> R,
pub fn tap_deref_mut_dbg<F, R>(self, func: F) -> Self where
Self: DerefMut,
F: FnOnce(&mut Self::Target) -> R,
Self: DerefMut,
F: FnOnce(&mut Self::Target) -> R,
impl<T> ToOwned for T where
T: Clone, [src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T[src]
pub fn clone_into(&self, target: &mut T)[src]
impl<T> TryConv for T
impl<T, U> TryFrom<U> for T where
U: Into<T>, [src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>, [src]
U: TryFrom<T>,