Graph explorer

Explore the knowledge graph

Public-key cryptography is part of Cryptography. Activate to inspect this relation.Digital signature is part of Cryptography. Activate to inspect this relation.Modular arithmetic applies to Divisibility. Activate to inspect this relation.P versus NP applies to Algorithm. Activate to inspect this relation.P versus NP is analogous to Riemann hypothesis. Activate to inspect this relation.One-way function depends on P versus NP. Activate to inspect this relation.RSA cryptosystem is a Public-key cryptography. Activate to inspect this relation.Elliptic-curve cryptography is a Public-key cryptography. Activate to inspect this relation.Zero-knowledge proof depends on Public-key cryptography. Activate to inspect this relation.RSA cryptosystem depends on Modular arithmetic. Activate to inspect this relation.RSA cryptosystem depends on One-way function. Activate to inspect this relation.Elliptic-curve cryptography depends on Modular arithmetic. Activate to inspect this relation.Digital signature depends on One-way function. Activate to inspect this relation.RSA cryptosystem enables Digital signature. Activate to inspect this relation.Class P is part of Complexity Class NP. Activate to inspect this relation.P versus NP applies to Class P. Activate to inspect this relation.P versus NP applies to Complexity Class NP. Activate to inspect this relation.One-way functionRSA cryptosystemDigital signatureP versus NPModular arithmeticPublic-key cryptographyCryptographyAlgorithmRiemann hypothesisClass PComplexity Class NPElliptic-curve cryptographyDivisibilityZero-knowledge proof
Relationship types
Legend
  • Focused concept
  • Connected concept
  • Arrow points from cause / source to effect / target
  • A line with no arrow is a two-way relationship
  • Node colour marks the concept’s primary discipline
14 concepts17 relationships10 disciplines5 relation families

One-way function

Open concept →

At a glance

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

Disciplines
Cryptography
Role in the graph
Cross-disciplinary bridge reaches Computational Complexity, Computer Science, Mathematics
Relationships
3 · 1 relation families

Insights from this view

Structural observations about the concepts shown here — descriptions of this graph, not claims about the world.

  • This view connects 10 disciplines: Algorithms, Computational Complexity, Computer Science, Cryptography, Discrete Mathematics, Logic, Mathematics, Number Theory, Software Engineering, Theory of Computation.
  • Algorithm is a bridge concept — viewed here through Algorithms, Computer Science, Discrete Mathematics, Logic, Mathematics, Software Engineering, Theory of Computation.
  • The connections here span 5 relation families.

Relationships as a list

The focused concept’s relationships. Pick another concept in the graph above to update this list.

Explore through a different lens

A lens is a deterministic projection of the graph. Pick a discipline, thinking pattern or journey to reframe the whole view.

By discipline

By thinking pattern

By journey

Concept collections

Concept collections are curated lenses onto the fabric — themed sets of ideas that recur across disciplines. They are not journeys; they are a way to read the graph.

About this view

What this is

Start from one concept and expand outward. The view never shows everything at once — click a node to refocus, filter by relationship type, or switch to an accessible list.

One fabric

3750 concepts and 5051 typed relations form one connected component — no isolated silo.

How to read it

Focus a concept, or apply a lens (discipline, mental model, journey) to see only the threads that matter.