Cryptographic functions

Start with the task a primitive performs. A system can use several of these functions at the same time, with separate keys and security assumptions.

  • Digital signature: a construction for signing messages with a private key and checking them with a public key; supports authenticity and integrity rather than confidentiality.
  • Key-encapsulation mechanism (KEM): algorithms for establishing shared secret material over a public channel under specified conditions.
  • Cryptographic hash: a fixed-length digest function used as a building block in identifiers, commitments, trees and many other constructions.
  • Preimage: an input corresponding to a specified digest; finding such an input is a different task from finding any collision.
  • Collision: two distinct inputs with the same hash digest; collision resistance and preimage resistance are different security properties.

Sources:NIST FIPS 204: ML-DSANIST SP 800-227: Recommendations for KEMsNIST Hash Functions project

Keys and signing operations

A key is used within a defined scheme and protocol role. Knowing the key type helps explain the relevant recovery rules and attack conditions.

  • Public key: non-secret key material used for operations such as signature verification or encapsulation; its availability matters to some attack models.
  • Private key: secret material enabling operations such as signing or decapsulation; storage and use require protection.
  • One-time signature (OTS): a signature construction whose individual signing key is intended for one signing use, with security depending on that restriction.
  • Stateful signature: a scheme requiring the signer to preserve changing private state and prevent prohibited reuse of one-time signing material.
  • Stateless signature: a scheme that avoids this consumable signing-state requirement; it still requires correct implementation and secure private keys.

Sources:RFC 8391: XMSSNIST FIPS 205: SLH-DSANIST SP 800-227: Recommendations for KEMs

Quantum security terminology

Quantum algorithm results describe capabilities under models and assumptions. They must be connected to complete resource estimates before making practical claims.

  • Post-quantum cryptography (PQC): cryptography designed to resist classical and quantum attackers while running on conventional computers.
  • Shor algorithm: quantum algorithms for problems including integer factorization and discrete logarithms, relevant to several existing public-key systems.
  • Grover algorithm: a quantum search algorithm giving a quadratic query advantage for suitable unstructured search problems.
  • Fault tolerance: methods for maintaining reliable logical computation despite errors in physical components; a crucial consideration for large attack computations.
  • Security parameter set: concrete choices within a scheme that determine claimed security properties, sizes and performance; the family name alone is insufficient.

Sources:NIST PQC introductionShor: factoring and discrete logarithmsGrover: quantum searchNIST FIPS 204: ML-DSA

Protocol and evidence terms

These terms help distinguish a proposed improvement from deployed behavior. Always retain the relevant network, software version and observation date.

  • UTXO: an unspent transaction output governed by spending conditions; Bitcoin wallets can control multiple UTXOs.
  • Validator signing key: a key used to sign consensus messages; its purpose can differ from the keys used to send funds.
  • Mainnet activation: a protocol feature becoming effective under a production network's rules; a published proposal or test deployment alone does not show activation.
  • Crypto agility: the capability to replace or adapt cryptography while preserving required security and operation.
  • Independent review: an assessment by a party separate from the implementer; its value depends on disclosed scope, methods, version and findings.

Sources:Bitcoin developer guide: transactionsEthereum proof-of-stake keysBitcoin BIP 3: Updated BIP processNIST CSWP 39upd1: Crypto agility