SUBSET-SUM - Algorand Specifications

Keyboard shortcuts

Press ← or → to navigate between chapters

Press S or / to search in the book

Press ? to show this help

Press Esc to hide this help

Algorand uses SUBSET-SUM algorithm, which is a quantum-resilient hash function.

This algorithm is used:

To create Merkle Trees for State Proofs,
To commit on ephemeral public keys in the Merkle Keystore structure used in the two-level Ephemeral Signature Scheme.

For further details on the Ephemeral Signature Scheme, refer to Algorand Keys normative specification.