Encryption¶

Transform a plaintext under a key into a ciphertext from which the message cannot be feasibly recovered without the decryption key — a computational asymmetry gated by a secret, so confidentiality depends only on who holds the key rather than on the channel.

Core Idea¶

Encryption transforms a plaintext under a key into a ciphertext from which the original cannot be feasibly recovered by any party lacking the decryption key. The defining commitment is computational asymmetry gated by a secret: encrypting and decrypting with the key are efficient, while inverting the ciphertext without it requires a problem believed infeasible (discrete log, factorization). Two key arrangements exist — symmetric (one shared key) and asymmetric (a published-encrypt/private-decrypt pair) — often combined in hybrid schemes like TLS.

Scope of Application¶

Encryption lives across the cryptographic-security cluster — the disciplines sharing both the keyed-transformation mathematics and the adversary-with-bounded-compute threat model.

Computer security — at-rest, in-transit (TLS), and end-to-end (Signal) confidentiality plus hybrid schemes.
Signals intelligence and diplomacy — substitution ciphers, one-time pads, Enigma: the same math by hand.
DRM and content protection — media encrypted under license keys.
Authentication-adjacent constructions — digital signatures, MACs, secure-boot chains anchored in a root key.
Post-quantum migration — the same reasoning re-sized against a quantum adversary (Kyber, Dilithium).

Clarity¶

Naming encryption separates it from encoding (reversible, no secret, conceals nothing) and hashing (irreversible, no recovery). It forces the right question — is there a secret, and does the operation reverse? — whose answer fixes the intervention family. It also makes confidentiality a local property: instead of asking who can read a message across every node and cable, the engineer asks the single question "who holds the key?", relocating the audit from the channel to key custody.

Manages Complexity¶

The raw confidentiality problem is unbounded — every node, cable, disk, and operator the bytes touch. Encryption collapses that surface to one quantity: who holds the key. The algorithm drops out (published standards assumed sound), leaving the key-management surface and threat model. The key arrangement reduces to a trust-context branch, the hardness guarantee to one comparison (assumed-hard problem versus adversary), and confidentiality-versus-integrity to whether AEAD is bundled in.

Abstract Reasoning¶

Encryption licenses boundary-drawing (classify the transformation and trust context before choosing a defense); a diagnostic move localizing confidentiality to key custody, not topology; threat-model reasoning that sizes every guarantee against a specified adversary and watches the integrity gap (chosen-ciphertext attacks, AEAD); and forward-secrecy reasoning about whether past traffic survives a key compromise.

Knowledge Transfer¶

Within the cryptographic-security cluster encryption transfers as mechanism — the transformation classification, the symmetric/asymmetric/hybrid branch, key-custody localization, threat-model sizing, and forward secrecy carry intact across computer security, classical cryptanalysis, DRM, and signatures, because these are one substrate. Beyond it, "genetic encoding" or "the diploma encrypts your transcript" borrows only concealment while dropping the secret-gated transformation. The parents that travel are information_asymmetry, access_control, and authentication; the asymmetric-inverse-difficulty lesson travels as trapdoor-function reasoning, a math/CS structure encryption instantiates.

Relationships to Other Abstractions¶

Current abstraction Encryption Domain-specific

Parents (2) — more general patterns this builds on

Encryption is a kind of Encoding And Decoding Prime

Encryption is Encoding and Decoding specialized to a secret-gated scheme whose code conceals content from parties lacking the decryption key.
Encryption is a decomposition of Asymmetry Prime

Removing cipher vocabulary leaves a directed, non-interchangeable cost relation between a key-holder and a party lacking the key.

Children (1) — more specific cases that build on this

Public-Key Cryptography Domain-specific is part of, conditional Encryption

Public-Key Cryptography contains Encryption in its confidential-transmission branch, where anyone encodes to a public key and only its private mate decodes.

Hierarchy paths (2) — routes to 2 parentless roots

Encryption → Encoding And Decoding → Transformation → Function (Mapping)

Show alternative path (1)

Neighborhood in Abstraction Space¶

Encryption sits in a sparse region of the domain-specific corpus (71^st percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (309 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-07-12