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
Cryptographic primitives serve distinct security properties.
DefinitionInformationPublic-key digital signaturesA signing key and a verification key have different roles.
DefinitionInformationComputable reductions and undecidabilityReduction direction determines which impossibility transfers.
Mathematical statementInformationDecision classes P and NPPolynomial solving and polynomial verification differ.
DefinitionInformationNP-hardness and NP-completenessNP-completeness combines verification and reduction hardness.
DefinitionInformationBounded-error randomized computationRandom choices permit a stated probability of error.
DefinitionInformationPost-quantum standards: exact status in October 2026NIST'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.
DefinitionInformationML-KEM: module lattices, CCA model and failuresFIPS 203 ML-KEM uses module-LWE-based public-key structure and a key-encapsulation transformation targeting IND-CCA2 security.
DefinitionInformationML-DSA and module-lattice signature obligationsFIPS 204 ML-DSA standardizes the Dilithium-derived module-lattice signature design, with ML-DSA-44/65/87 at security categories 2/3/5.
DefinitionInformationHash-based and lattice-based signatures comparedSLH-DSA is a stateless hash-based signature design, while ML-DSA uses module-lattice structure.
DefinitionInformationPost-quantum migration, hybrid composition and assuranceA migration inventory must identify long-lived confidential data, key establishment versus signatures, protocol/certificate formats and parameter/revision dependencies.
MethodInformationEncryption security as an IND-CPA experimentIn an indistinguishability experiment, an efficient adversary selects equal-length messages and receives an encryption of one chosen by a hidden random bit.
DefinitionInformationChosen-ciphertext security and decryption accessAdaptive chosen-ciphertext security allows decryption queries before and after a challenge, excluding the challenge ciphertext itself under the experiment's rules.
DefinitionInformationMAC unforgeability and what a forgery meansExistential 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.
DefinitionInformationSignature security and public verificationEUF-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.
DefinitionInformationSecurity reductions, hybrids and concrete errorA reduction turns a successful scheme attacker into an attacker on a stated assumption, with explicitly related time, query count and success probability.
MethodInformationProof security and implementation leakageA 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