Performs the multiplication operation. Note this is a simple implementation that is suitable for secret sharing schemes, but may be inneficient for o

Drop-in replacement for `bincode::deserialize` that enforces [`MAX_DESERIALIZE_BYTES`].

Performs polynomial addition in place

Evaluates the polynomial at the specified value.

Commits the scalar polynomial to the group and returns a polynomial over the group This is done by multiplying each coefficient of the polynomial wit

Drop-in replacement for `bincode::deserialize_from` that enforces [`MAX_DESERIALIZE_BYTES`].

Returns the constant term of the polynomial which can be interpreted as the threshold public key

Verifies the signature after it has been unblinded. Users will call this on the threshold signature against the full public key public_key: The publi

Builds the fixed-coefficient private polynomial, derives the matching shares and public polynomial, and returns everything needed by the wire-format t

Blake2s CRH followed by Blake2x XOF expansion. This is equivalent to `bls-crypto`'s `DirectHasher::hash()`.

Given a message and a seed, it will blind it and return the blinded message message: A cleartext message which you want to blind seed: A 32 byte seed

Returns the degree of the polynomial

Given a blinded message and a blinding_factor used for blinding, it returns the message unblinded blinded_message: A message which has been blinded o

Verifies the signature after it has been unblinded without hashing. Users will call this on the threshold signature against the full public key publi

Encodes the XOF digest length into the node offset field used by Blake2s/Blake2x.

Combines a flattened vector of partial signatures to a single threshold signature NOTE: Wasm-bindgen does not support Vec<Vec<u8>>, so this function

Deserializes a private key from the provided buffer # Safety - **This function will dereference the provided pointers. If any invalid pointers are pa

Deserializes a public key from the provided buffer # Safety - **This function will dereference the provided pointers. If any invalid pointers are pas

get returns the given coefficient at the requested index. It will panic if the index is out of range,i.e. `if i > self.degree()`.

Create a deterministic RNG for reproducible key generation

Serializes a private key to the provided buffer # Safety - **This function will dereference the provided pointers. If any invalid pointers are passed

Serializes a public key to the provided buffer # Safety - **This function will dereference the provided pointers. If any invalid pointers are passed

Generates a t-of-n polynomial and private key shares # Safety WARNING: This is a helper function for local testing of the library. Do not use in pro

Decrypts the message with a secret key (curve scalar) and returns the cleartext

Derives an ephemeral key from the provided public key

Deserializes a signature from the provided buffer # Safety - **This function will dereference the provided pointers. If any invalid pointers are pass

Frees the memory allocated for the keypair helper # Safety The pointer must point to a valid instance of the data type

Frees the memory allocated for a private key # Safety The pointer must point to a valid instance of the data type

Frees the memory allocated for a public key # Safety The pointer must point to a valid instance of the data type

Frees the memory allocated for a signature # Safety The pointer must point to a valid instance of the data type

Frees the memory allocated for the blinding factor # Safety The pointer must point to a valid instance of the data type

Encrypts the message with a public key (curve point) and returns a ciphertext

Frees the memory allocated for a vector # Safety The pointer must point to a valid instance of the data type

Given at least `t` polynomial evaluations, it will recover the entire polynomial