← Back
In graph Frontier
CryptographyStrongly supported

One-way function

A function easy to compute but infeasible to invert, the conjectured bedrock of modern cryptography.

At a glance

Type
information
Disciplines 1
Mental models 0
Role in the graph
Cross-disciplinary bridge
reaches 3 discipline lenses

Key signals

Cross-disciplinary reach
Disciplines
1
  • Cryptography
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.

Foundations · builds on

One-way functiondepends onP versus NPEstablished

Open P versus NP →

Easy forward, hard back.

Mechanism: One-way functions can exist only if P ≠ NP — the bedrock assumption of cryptography.

Enables · leads to

Digital signaturedepends onOne-way functionEstablished

Open Digital signature →

Digital signatures rely on one-way (trapdoor) functions.

Mechanism: Only the private-key holder can produce a signature (invert the trapdoor), while anyone can verify it in the easy direction.

RSA cryptosystemdepends onOne-way functionEstablished

Open RSA cryptosystem →

RSA's security rests on a one-way (trapdoor) function.

Mechanism: Multiplying two large primes is easy but factoring their product is believed hard; the trapdoor (the private key) makes inversion feasible only for the key holder.

Structural role & consequence

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

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

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

  • Builds on 1 foundation (requires / depends-on / derived-from / emerges-from).

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

  • Structural neighbourhood: 3 → 10 → 37 concepts reachable within 3 hops.

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

33%

cross-field
2 within-field, 1 cross-field

0 of 3 relations carry evidence · concept unsourced

Strengths & constraints

Constraints

  • Evidence coverage currently thin in the atlas — few of its relationships carry claim-level evidence. atlas representation
  • No dated history stored — the atlas records no key date for this concept. atlas representation

Conditions

  • Its dependency reading rests on 1 foundation relation. structural
  • 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.

P versus NPDigital signatureRSA cryptosystemOne-way function◀ builds onenables ▶

What builds on this

2 concepts build on this directly, 2 in total, across 2 disciplines.

Computer ScienceCryptography

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.

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

  • P versus NPComputer ScienceMathematicsComputational Complexity

    crosses a discipline boundary

The scientific picture
  • Connects 3 other ideas across 1 discipline.
  • A cross-disciplinary bridge — its connections reach into 3 other fields.
  • Most of its connections are of the “Dependency” kind.

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

Sources

No primary source is attached to this concept yet. In a real deployment this would be required before publication.