Struct PublicKey 

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

Public key represented as a polynomial with coefficients over the Falcon prime field.

Implementations

impl PublicKey

pub fn verify(&self, message: Word, signature: &Signature) -> bool

Verifies the provided signature against provided message and this public key.

pub fn recover_from(_message: Word, signature: &Signature) -> PublicKey

Recovers from the signature the public key associated to the secret key used to sign a message.

pub fn to_commitment(&self) -> Word

Returns a commitment to the public key using the Poseidon2 hash function.

Methods from Deref<Target = Polynomial<FalconFelt>>

pub fn hadamard_mul(&self, other: &Polynomial<F>) -> Polynomial<F>

Multiplies two polynomials coefficient-wise (Hadamard multiplication).

pub fn hadamard_div(&self, other: &Polynomial<F>) -> Polynomial<F>

Divides two polynomials coefficient-wise (Hadamard division).

pub fn hadamard_inv(&self) -> Polynomial<F>

Computes the coefficient-wise inverse (Hadamard inverse).

pub fn degree(&self) -> Option<usize>

Returns the degree of the polynomial.

pub fn lc(&self) -> F

Returns the leading coefficient of the polynomial.

pub fn reduce_by_cyclotomic(&self, n: usize) -> Polynomial<F>

Reduce the polynomial by X^n + 1.

pub fn field_norm(&self) -> Polynomial<F>

Computes the field norm of the polynomial as an element of the cyclotomic ring F[ X ] / <X^n + 1 > relative to one of half the size, i.e., F[ X ] / <X^(n/2) + 1> .

Corresponds to formula 3.25 in the spec [1, p.30].

pub fn lift_next_cyclotomic(&self) -> Polynomial<F>

Lifts an element from a cyclotomic polynomial ring to one of double the size.

pub fn galois_adjoint(&self) -> Polynomial<F>

Computes the galois adjoint of the polynomial in the cyclotomic ring F[ X ] / < X^n + 1 > , which corresponds to f(x^2).

pub fn karatsuba(&self, other: &Polynomial<F>) -> Polynomial<F>

Multiply two polynomials using Karatsuba’s divide-and-conquer algorithm.

pub fn shift(&self, shamt: usize) -> Polynomial<F>

Shifts the polynomial by the specified amount (adds leading zeros).

pub fn map<G, C>(&self, closure: C) -> Polynomial<G>

where G: Clone, C: FnMut(&F) -> G,

Applies a function to each coefficient and returns a new polynomial.

pub fn fold<G, C>(&self, initial_value: G, closure: C) -> G

where C: FnMut(G, &F) -> G + Clone,

Folds the coefficients using the provided function and initial value.

pub fn norm_squared(&self) -> u64

Computes the squared L2 norm of the polynomial.

pub fn to_elements(&self) -> Vec<Goldilocks>

Returns the coefficients of this polynomial as field elements.

Trait Implementations

impl Clone for PublicKey

fn clone(&self) -> PublicKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PublicKey

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

Formats the value using the given formatter.

impl Deref for PublicKey

type Target = Polynomial<FalconFelt>

The resulting type after dereferencing.

fn deref(&self) -> &<PublicKey as Deref>::Target

Dereferences the value.

impl Deserializable for PublicKey

fn read_from<R>(source: &mut R) -> Result<PublicKey, DeserializationError>

where R: ByteReader,

Reads a sequence of bytes from the provided source, attempts to deserialize these bytes into Self, and returns the result.

fn min_serialized_size() -> usize

Returns the minimum serialized size for one instance of this type.

fn read_from_bytes(bytes: &[u8]) -> Result<Self, DeserializationError>

Attempts to deserialize the provided bytes into Self and returns the result.

fn read_from_bytes_with_budget( bytes: &[u8], budget: usize, ) -> Result<Self, DeserializationError>

Deserializes Self from bytes with a byte budget limit.

impl From<Polynomial<FalconFelt>> for PublicKey

fn from(pk_poly: Polynomial<FalconFelt>) -> PublicKey

Converts to this type from the input type.

impl PartialEq for PublicKey

fn eq(&self, other: &PublicKey) -> 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 SequentialCommit for PublicKey

type Commitment = Word

A type of the commitment which must be derivable from Word.

fn to_elements(&self) -> Vec<Goldilocks>

Returns a representation of the object as a sequence of fields elements.

fn to_commitment(&self) -> Self::Commitment

Computes the commitment to the object.

impl Serializable for &PublicKey

fn write_into<W>(&self, target: &mut W)

where W: ByteWriter,

Serializes self into bytes and writes these bytes into the target.

fn to_bytes(&self) -> Vec<u8>

Serializes self into a vector of bytes.

fn get_size_hint(&self) -> usize

Returns an estimate of how many bytes are needed to represent self.

impl Eq for PublicKey

impl StructuralPartialEq for PublicKey