crypto_bigint

Module prelude

Source
Expand description

Import prelude for this crate: includes important traits.

Traits§

  • Compute self + rhs mod p.
  • Integers whose representation takes a bounded amount of space.
  • Checked addition.
  • Checked multiplication.
  • Checked subtraction.
  • Concatenate two numbers into a “wide” double-width value, using the lo value as the least significant value.
  • Concatenate two numbers into a “wide” combined-width value, using the lo value as the least significant value.
  • Encoding support.
  • Integer type.
  • Constant-time inversion.
  • Compute self * rhs mod p.
  • Performs modular multi-exponentiation using Montgomery’s ladder.
  • Performs modular multi-exponentiation using Montgomery’s ladder. exponent_bits represents the number of bits to take into account for the exponent.
  • Compute -self mod p.
  • Constant-time exponentiation.
  • Constant-time exponentiation with exponent of a bounded bit size.
  • Split a number in half, returning the most significant half followed by the least significant.
  • Split a number into parts, returning the most significant part followed by the least significant.
  • Support for optimized squaring
  • Compute self - rhs mod p.
  • Zero values.