GLOBAL KNOWLEDGE ARK

Reference library

Foundations

Explore concepts, laws, equations and methods, with clear explanations of their use and sources. Choose an area of study or find a specific entry.

More filters

Security & cryptography

Showing 1–17 of 17 reference entries

InformationEncryption, hashes and message authentication

Cryptographic primitives serve distinct security properties.

Definition
InformationPublic-key digital signatures

A signing key and a verification key have different roles.

Definition
InformationComputable reductions and undecidability

Reduction direction determines which impossibility transfers.

Mathematical statement
InformationDecision classes P and NP

Polynomial solving and polynomial verification differ.

Definition
InformationNP-hardness and NP-completeness

NP-completeness combines verification and reduction hardness.

Definition
InformationBounded-error randomized computation

Random choices permit a stated probability of error.

Definition
InformationPost-quantum standards: exact status in October 2026

NIST's project page, updated 5 August 2026 and checked 10 October, lists FIPS 203 ML-KEM, FIPS 204 ML-DSA and FIPS 205 SLH-DSA as final standards published 13 August 2024.

Definition
InformationML-KEM: module lattices, CCA model and failures

FIPS 203 ML-KEM uses module-LWE-based public-key structure and a key-encapsulation transformation targeting IND-CCA2 security.

Definition
InformationML-DSA and module-lattice signature obligations

FIPS 204 ML-DSA standardizes the Dilithium-derived module-lattice signature design, with ML-DSA-44/65/87 at security categories 2/3/5.

Definition
InformationHash-based and lattice-based signatures compared

SLH-DSA is a stateless hash-based signature design, while ML-DSA uses module-lattice structure.

Definition
InformationPost-quantum migration, hybrid composition and assurance

A migration inventory must identify long-lived confidential data, key establishment versus signatures, protocol/certificate formats and parameter/revision dependencies.

Method
InformationEncryption security as an IND-CPA experiment

In an indistinguishability experiment, an efficient adversary selects equal-length messages and receives an encryption of one chosen by a hidden random bit.

Definition
InformationChosen-ciphertext security and decryption access

Adaptive chosen-ciphertext security allows decryption queries before and after a challenge, excluding the challenge ciphertext itself under the experiment's rules.

Definition
InformationMAC unforgeability and what a forgery means

Existential unforgeability under chosen-message attack requires that an efficient adversary with a tagging oracle cannot produce a valid tag for a new message with more than negligible probability.

Definition
InformationSignature security and public verification

EUF-CMA signature security gives an adversary a public verification key and signing oracle, then tests whether it can produce a valid signature on a previously unsigned message.

Definition
InformationSecurity reductions, hybrids and concrete error

A reduction turns a successful scheme attacker into an attacker on a stated assumption, with explicitly related time, query count and success probability.

Method
InformationProof security and implementation leakage

A proof in a black-box encryption or signature game typically exposes specified outputs and oracles, not secret-dependent timing, power, cache traces or fault responses.

Method