blst

func (*BLST) AggregatePublicKeys ¶

func (b *BLST) AggregatePublicKeys(pubs [][]byte) (common.PublicKey, error)

AggregatePublicKeys aggregates the provided raw public keys into a single key.

func (*BLST) AggregateSignatures ¶

func (b *BLST) AggregateSignatures(sigs []common.Signature) common.Signature

AggregateSignatures converts a list of signatures into a single, aggregated sig.

func (*BLST) NewAggregateSignature ¶

func (b *BLST) NewAggregateSignature() common.Signature

NewAggregateSignature creates a blank aggregate signature.

func (*BLST) PublicKeyFromBytes ¶

func (b *BLST) PublicKeyFromBytes(pubKey []byte) (common.PublicKey, error)

PublicKeyFromBytes creates a BLS public key from a BigEndian byte slice.

func (*BLST) RandKey ¶

func (b *BLST) RandKey() (common.SecretKey, error)

RandKey creates a new private key using a random method provided as an io.Reader.

func (*BLST) SecretKeyFromBytes ¶

func (b *BLST) SecretKeyFromBytes(privKey []byte) (common.SecretKey, error)

SecretKeyFromBytes creates a BLS private key from a BigEndian byte slice.

func (*BLST) SignatureFromBytes ¶

func (b *BLST) SignatureFromBytes(sig []byte) (common.Signature, error)

SignatureFromBytes creates a BLS signature from a LittleEndian byte slice.

func (*BLST) VerifyCompressed ¶

func (b *BLST) VerifyCompressed(signature []byte, pub []byte, msg []byte) bool

VerifyCompressed verifies that the compressed signature and pubkey are valid from the message provided.

func (*BLST) VerifyMultipleSignatures ¶

func (b *BLST) VerifyMultipleSignatures(sigs [][]byte, msgs [][32]byte, pubKeys []common.PublicKey) (bool, error)

VerifyMultipleSignatures verifies a non-singular set of signatures and its respective pubkeys and messages. This method provides a safe way to verify multiple signatures at once. We pick a number randomly from 1 to max uint64 and then multiply the signature by it. We continue doing this for all signatures and its respective pubkeys. S* = S_1 * r_1 + S_2 * r_2 + ... + S_n * r_n P'_{i,j} = P_{i,j} * r_i e(S*, G) = \prod_{i=1}^n \prod_{j=1}^{m_i} e(P'_{i,j}, M_{i,j}) Using this we can verify multiple signatures safely.

func (*PublicKey) Aggregate ¶

func (p *PublicKey) Aggregate(p2 common.PublicKey) common.PublicKey

Aggregate two public keys.

func (*PublicKey) Copy ¶

func (p *PublicKey) Copy() common.PublicKey

Copy the public key to a new pointer reference.

func (*PublicKey) Hash ¶

func (p *PublicKey) Hash() ([20]byte, error)

Hash calculates the hash of the public key.

func (*PublicKey) IsInfinite ¶

func (p *PublicKey) IsInfinite() bool

IsInfinite checks if the public key is infinite.

func (*PublicKey) Marshal ¶

func (p *PublicKey) Marshal() []byte

Marshal a public key into a LittleEndian byte slice.

func (*PublicKey) ToAccount ¶

func (p *PublicKey) ToAccount(prefix *params.AccountPrefixes) string

ToAccount converts the public key to a Bech32 address.

func (*Signature) AggregateVerify ¶

func (s *Signature) AggregateVerify(pubKeys []common.PublicKey, msgs [][32]byte) bool

AggregateVerify verifies each public key against its respective message. This is vulnerable to rogue public-key attack. Each user must provide a proof-of-knowledge of the public key.

In IETF draft BLS specification: AggregateVerify((PK_1, message_1), ..., (PK_n, message_n),

signature) -> VALID or INVALID: an aggregate verification
algorithm that outputs VALID if signature is a valid aggregated
signature for a collection of public keys and messages, and
outputs INVALID otherwise.

In ETH2.0 specification: def AggregateVerify(pairs: Sequence[PK: BLSPubkey, message: Bytes], signature: BLSSignature) -> boo

func (*Signature) Copy ¶

func (s *Signature) Copy() common.Signature

Copy returns a full deep copy of a signature.

func (*Signature) FastAggregateVerify ¶

func (s *Signature) FastAggregateVerify(pubKeys []common.PublicKey, msg [32]byte) bool

FastAggregateVerify verifies all the provided public keys with their aggregated signature.

In IETF draft BLS specification: FastAggregateVerify(PK_1, ..., PK_n, message, signature) -> VALID

or INVALID: a verification algorithm for the aggregate of multiple
signatures on the same message.  This function is faster than
AggregateVerify.

In ETH2.0 specification: def FastAggregateVerify(PKs: Sequence[BLSPubkey], message: Bytes, signature: BLSSignature) -> bool

func (*Signature) Marshal ¶

func (s *Signature) Marshal() []byte

Marshal a signature into a LittleEndian byte slice.

func (*Signature) Verify ¶

func (s *Signature) Verify(pubKey common.PublicKey, msg []byte) bool

Verify a bls signature given a public key, a message.

In IETF draft BLS specification: Verify(PK, message, signature) -> VALID or INVALID: a verification

algorithm that outputs VALID if signature is a valid signature of
message under public key PK, and INVALID otherwise.

In ETH2.0 specification: def Verify(PK: BLSPubkey, message: Bytes, signature: BLSSignature) -> bool