Error-correcting Code
Extra check bits help detect or correct specified errors. Their protection depends on the code, use policy and fault model.
GLOSSARY
Use each definition as a bridge back to the articles where the idea matters.
Extra check bits help detect or correct specified errors. Their protection depends on the code, use policy and fault model.
Deliberately perturbing a circuit to test or exploit faulty behavior under a stated model.
The allowed targets, effects, timing, fault budget and trusted boundaries of an experiment.
The interface event at which the downstream consumer accepts a protected operation.
Establishes a transport channel with applicable authentication and data protection.
Agrees a shared secret using ephemeral elliptic-curve key material.
Extracts and derives purpose-specific material; it does not manufacture entropy.
The handshake-message history accumulated under the protocol's rules.
Binds the corresponding private-key capability to the current handshake using a signature.
Confirms the handshake and keys through a derived-key MAC.
Combines encryption and authentication for record protection.
Uses certificates to authenticate both TLS peers; authorization remains separate.
Under its assumptions, later long-term-key compromise does not reveal past session keys.
Early data sent before handshake completion, with different replay and secrecy guarantees.
Evidence created with a private key and checked with a public key for a particular message; key identity and usage policy remain separate requirements.
A signed data structure that binds a public key to an identity or other attributes under an issuer's policy.
The roles, policies, systems, and lifecycle processes used to issue, validate, renew, and revoke public-key certificates.
A standard framework for public-key certificates and certification paths.
A locally accepted starting point for trust decisions, such as a public key, key digest, or root certificate used by Secure Boot or certificate-path validation.
A startup policy that authenticates covered next-stage code before granting it execution.
A structured description of assets, attacker capabilities, reachable entry points, assumptions, and potential impact used to choose defenses.
A hardware- and software-supported isolated environment for sensitive code or data; isolation depends on implementation and configuration and is not absolute security.
A protected version policy that rejects authenticated software older than the minimum version currently allowed.
The rules that keep cached copies of one address consistent across agents.
A cache-coherence protocol built around Modified, Exclusive, Shared, and Invalid states.
Unrelated writes contend because their variables occupy the same cache line.
A family of cryptographic hash algorithms that maps arbitrary-length data to a fixed-length digest.
A circuit that uses physical variation to produce device-dependent responses; reliability and secrecy require separate evaluation.
A symmetric block cipher that transforms 128-bit blocks through repeated rounds.
A clock-aware hardware description of registers, data paths, and control transfers.
Useful work completed per unit time under a stated workload and measurement method.
A bound on speedup for a fixed workload when a serial fraction cannot be parallelized.
Instructions completed per clock cycle; a key measure beyond frequency.
Memory-level parallelism: overlapping multiple outstanding memory operations.
Stacked DRAM connected through a very wide, short interface for high bandwidth.
A vertical electrical connection passing through a silicon die.
A fine-line build-up film used as dielectric material in advanced package substrates.
A PCIe-based interconnect family for I/O, coherent device caching, and expandable memory.
A chip optimized for a specific workload instead of general-purpose execution.
A large language model that generates text by repeatedly predicting the next token from context.
The text unit used by a model after tokenization; it maps to a vocabulary id.
A mechanism that lets a token compare its query with keys from other tokens and combine their values.
Cached Key and Value tensors from previous tokens, reused during autoregressive decoding.
A validation standard for the design and operation of cryptographic modules.
The EU Cyber Resilience Act: lifecycle cybersecurity requirements for products with digital elements placed on the Union market.
An advanced package integrating compute and memory through an interposer.
A public-key family whose security relies on the difficulty of factoring a large composite integer.
Public-key cryptography based on the difficulty of elliptic-curve discrete logarithms.
A finite set with well-defined addition, subtraction, multiplication, and division by nonzero elements.
A hardware-anchored trusted subsystem that provides difficult-to-bypass foundations for defined security services.
Device-specific root secret material retained or reconstructed inside a protected boundary and not exported to ordinary software.
A storage service that combines confidentiality as needed with integrity, ownership isolation, access control, and freshness.
A sequence in which an established trusted stage verifies or authorizes the next stage.
A quantum algorithmic framework that efficiently solves integer factorization and discrete logarithms on a suitable quantum computer.
Public-key cryptography designed to resist known attacks from both classical and quantum computers.
A processor that keeps a large programmable compute fabric and distributed memory on one silicon wafer.
An execution model in which data arrival and readiness help determine when work can run.
Electrical connections aligned across neighboring lithography fields on an uncut wafer.