Thinking·OS
← Back
In graph Frontier
Computer ScienceEstablished

Public-key cryptography

Public-key cryptography, or asymmetric cryptography, is the field of cryptographic systems that use pairs of related keys.

Public-key cryptographyCryptographyRSA cryptosystemElliptic-curve cryptographyZero-knowledge proofHomomorphic encryptionPost-quantum cryptographyEncryptionInformation

At a glance

Type
information
Disciplines 1
Computer Science
Mental models 0
—
Role in the graph
Local hub

Key signals

Cross-disciplinary reach
Disciplines
1
  • Computer Science
Evidence & development

Dependencies

What this concept builds on and what it makes possible — derived from the atlas’s dependency, causal and structural relations, not from every related edge.

Enables · leads to

Zero-knowledge proofdepends onPublic-key cryptographyEstablished

Open Zero-knowledge proof →

Prove without revealing.

Mechanism: Zero-knowledge proofs let one convince another of a secret's truth while revealing nothing.

System context

Public-key cryptographyis part ofCryptographyEstablished

Open Cryptography →

public-key cryptography is part of cryptography.

Mechanism: Public-key cryptography is a branch of cryptography using a pair of keys: one public to lock a message, one private to unlock it.

Sources:
Elliptic-curve cryptographyis aPublic-key cryptographyEstablished

Open Elliptic-curve cryptography →

Small keys, strong security.

Mechanism: Elliptic-curve cryptography gets public-key strength from curve algebra with far shorter keys.

Homomorphic encryptionis aPublic-key cryptographyEstablished

Open Homomorphic encryption →

Compute on ciphertext.

Mechanism: Homomorphic encryption lets a server compute on data it can never read.

RSA cryptosystemis aPublic-key cryptographyEstablished

Open RSA cryptosystem →

Security from factoring.

Mechanism: RSA is a public-key scheme safe because factoring a big semiprime is hard — until quantum computers.

Structural role & consequence

Interpreted from the current atlas graph — what the connections mean, not just how many there are.

  • Removing this node severs the only sampled structural route between Elliptic-curve cryptography and Homomorphic encryption — a non-redundant bridge here.

    structural · Structural removal simulation — not a historical or causal counterfactual.

  • 83% of its relationships cross field boundaries, reaching 1 other discipline — unusual in a discipline where most concepts stay within their field.

    structural · Structural graph analysis — not a claim of importance, causation or history.

  • Currently dark in the atlas: no key date stored · 6 of 6 of its relations lack claim-level evidence.

    atlas representation · Describes the current Thinking OS representation, not the state of the world.

  • Structural neighbourhood: 6 → 13 → 25 concepts reachable within 3 hops.

    structural · Structural reach — being reachable is not the same as being understood.

83%

cross-field
1 within-field, 5 cross-field

0 of 6 relations carry evidence · concept has a verified source

Strengths & constraints

Strengths

  • Cross-disciplinary connector — 83% of its relationships cross field boundaries. structural

Constraints

  • Evidence coverage currently thin in the atlas — few of its relationships carry claim-level evidence. atlas representation
  • Non-redundant bridge — removing it severs a sampled route between neighbouring clusters. structural
  • No dated history stored — the atlas records no key date for this concept. atlas representation

Conditions

  • Read structurally — most of its relationships carry no external evidence yet, so claims here are graph-derived. structural

Dependency radial

What this concept builds on (left) and what it makes possible (right) — derived from dependency and causal relations.

Zero-knowledge proofPublic-key cryptograp…◀ builds onenables ▶

What builds on this

1 concept build on this directly, 1 in total, across 1 discipline.

Cryptography

Structural downstream reach along dependency edges — not a claim of historical necessity.

Seen through each discipline

How this concept sits in each of its fields — derived from its real connections in the graph, not asserted.

Computer Science

Through this lens it connects to Cryptography.

Public-key cryptography through the Computer Science lens →

Concepts that look related but are not yet connected here — candidates for a connection to reason about, not established links.

This idea also appears in…

The same structure shows up in other disciplines. These are real recurrences drawn from the graph — a starting point for asking “what carries over, and what changes?”

Concepts

The scientific picture
  • Connects 6 other ideas across 1 discipline.
  • A local hub: unusually many ideas converge here.
  • Most of its connections are of the “Kind & structure” kind.

Derived from the graph’s real structure — observations, not a score.

Sources