{"query": "Public-key cryptography — RSA", "count": 17, "results": [{"id": "card_crypto_public_key", "title": "Public-key cryptography — RSA", "shelf": "codex", "surface": "secular", "snippet": "Encrypt with a public key, decrypt with a private one; the two are inverse modulo phi(n). The RSA round-trip (m -> c -> m by modular exponentiation) is sealed. Rests on the instruments (number theory ", "authority_tier": "engine_derived", "source": "Narrow Highway — cryptography", "readable": false, "generated": false}, {"id": "card_theory_fundamental_theorem_of_arithmetic", "title": "Fundamental theorem of arithmetic (unique factorization)", "shelf": "theories", "surface": "secular", "snippet": "Fundamental theorem of arithmetic (unique factorization) — an engine domain that can touch it: number_theory. Calibration: seals. Every integer greater than 1 is a product of primes in exactly one way", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_sys_oneway_function", "title": "The one-way function — the computational rectifier", "shelf": "systems", "surface": "secular", "snippet": "Some computations are cheap one way and infeasible the reverse. A one-way function is easy to evaluate (polynomial time) but computationally infeasible to invert; a TRAPDOOR one-way function adds a se", "authority_tier": "reference", "source": "The recurring form — the system analogies (standard engineering) + the design they witness to", "readable": false, "generated": false}, {"id": "card_bridge_master_modular_exponentiation", "title": "Master equation: c = a^k mod n", "shelf": "bridges", "surface": "secular", "snippet": "the one-way power at the root of the discrete world: raising to a power modulo n is cheap, but inverting it — recovering the exponent, or factoring n — is hard on a classical machine and easy on a qua", "authority_tier": "reference", "source": "The Bridges — cross-domain isomorphisms", "readable": false, "generated": false}, {"id": "card_alm_connection_reality_is_mappable", "title": "Almanac: Reality is mappable: the same verified structure recurs across every domain", "shelf": "almanac", "surface": "secular", "snippet": "SITUATION\n  Across this whole moat -- physics, computer science, music, genetics -- the engine kept finding the SAME structures wearing different clothes, and this grand capstone confirms it by drawin", "authority_tier": "reference", "source": "The Almanac — verified-only practical wisdom (sealed)", "readable": false, "generated": false}, {"id": "card_n_7898952343a9", "title": "Reading the body's dashboard — HRV, pupil, sleep, gut as a within-person slope", "shelf": "science", "surface": "secular", "snippet": "The framework reads four gauges as the body's dashboard: HRV/RSA (vagal brake), pupillometry (LC-NE\nproxy), sleep metrics (allostatic recovery), and GI signals (interoceptive load). The red-team's\nwar", "authority_tier": "engine_derived", "source": "Concordance assay — 2026-07-10", "readable": false, "generated": false}, {"id": "card_ncs_l3_neurovisceral_integration", "title": "Neurovisceral Integration / Central Autonomic Network", "shelf": "regulation", "surface": "secular", "snippet": "Level 3 of the Nested Control-Systems stack. The executive-autonomic control loop: the prefrontal-vagal brake governs state switching; HRV/RSA is a direct efficiency index of that inhibitory loop (low", "authority_tier": "reference", "source": "Thayer & Lane (2000), J. Affect. Disord. 61:201; Thayer & Lane (2009), Neurosci. Biobehav. Rev. 33:81.", "readable": false, "generated": false}, {"id": "card_c_c9d93c617f53", "title": "Reading the body's dashboard — HRV, pupil, s ↔ The autonomic spine — four theories, one cau", "shelf": "connections", "surface": null, "snippet": "HRV/RSA (vagal brake), pupillometry (LC-NE proxy), sleep metrics (allostatic recovery), and GI signals (interoceptive load).  — a concord the card itself states; mined + verified.", "authority_tier": "engine_derived", "source": "Concordance miner — 2026-07-11", "readable": false, "generated": false}, {"id": "card_ncs_framework_discernment", "title": "Nested Control Systems — the framework, with its falsifiers", "shelf": "regulation", "surface": "secular", "snippet": "The Nested Control-Systems framework reads chronic dysregulation as failure in a NESTED stack of control layers rather than as separate competing diseases: a computational frame (predictive processing", "authority_tier": "reference", "source": "Nested Control-Systems framework — Friston 2005; Aston-Jones & Cohen 2005; Thayer & Lane 2000/2009; Barrett & Simmons 2015; Stephan et al. 2023", "readable": false, "generated": false}, {"id": "card_floor_cryptography", "title": "Cryptography — public keys and hard problems", "shelf": "codex", "surface": "secular", "snippet": "Secrecy built on number theory and computational hardness. RSA encrypts with a public key and decrypts with a private one (the round-trip sealed), its security the belief that factoring is hard; the o", "authority_tier": "engine_derived", "source": "Narrow Highway — cryptography", "readable": false, "generated": false}, {"id": "card_src_rfc_3447", "title": "RFC3447 — Public-Key Cryptography Standards (PKCS) #1: RSA Cryptography Specifications Version 2.1", "shelf": "rfcs", "surface": "secular", "snippet": "RFC3447: Public-Key Cryptography Standards (PKCS) #1: RSA Cryptography Specifications Version 2.1 (February 2003). Status: INFORMATIONAL. Obsoleted by RFC8017. Obsoletes RFC2437.", "authority_tier": "reference", "source": "The RFC Index (RFC Editor / IETF) — public domain", "readable": false, "generated": false}, {"id": "card_tool_ecc_ed25519", "title": "Elliptic-curve cryptography (ECC / Ed25519)", "shelf": "tools", "surface": "secular", "snippet": "Elliptic-curve cryptography (ECC / Ed25519) — cryptography. GOOD AT: fast digital signatures and key agreement with tiny keys — a 32-byte Ed25519 key carries security comparable to RSA-3072. REACH WHE", "authority_tier": "battle-tested standard", "source": "The Tool Concordance — discern, connect, incorporate", "readable": false, "generated": false}, {"id": "card_src_rfc_4055", "title": "RFC4055 — Additional Algorithms and Identifiers for RSA Cryptography for use in the Internet X.509 Public Key Infrastructure Certificate and Certificate Revocation List (CRL) Profi", "shelf": "rfcs", "surface": "secular", "snippet": "RFC4055: Additional Algorithms and Identifiers for RSA Cryptography for use in the Internet X.509 Public Key Infrastructure Certificate and Certificate Revocation List (CRL) Profile (June 2005). Statu", "authority_tier": "reference", "source": "The RFC Index (RFC Editor / IETF) — public domain", "readable": false, "generated": false}, {"id": "card_crypto_hardness", "title": "Hardness — security is a hard problem", "shelf": "codex", "surface": "secular", "snippet": "RSA is secure only because factoring n into its primes is believed hard; break that (or prove P = NP, or run Shor's quantum algorithm) and it falls. Security IS a hardness assumption. Rests on the P v", "authority_tier": "engine_derived", "source": "Narrow Highway — cryptography", "readable": false, "generated": false}, {"id": "card_calc_rsa_modexp", "title": "RSA (modular exponentiation)", "shelf": "calculations", "surface": "secular", "snippet": "RSA (modular exponentiation) — cybersecurity. Formula: c = m^e mod n. Canonical FORM: number_theoretic (a^x = 1 (mod m)) — public-key encryption is exponentiation in a finite ring. Same form, differen", "authority_tier": "reference", "source": "The Calculation Map — every calculation, mapped by form", "readable": false, "generated": false}, {"id": "card_seal_21e3c1e17653e49e90b41a44ba59b169d9210d48ad2402ec8eedb62759376498", "title": "Receipt 21e3c1e17653… — sealed: record", "shelf": "seals", "surface": "secular", "snippet": "{\n \"anchors\": [],\n \"axis_coords\": {\n  \"axis\": \"mathematics\",\n  \"dimensions\": [\n   \"reasoning\"\n  ]\n },\n \"gate_results\": [\n  {\n   \"details\": {\n    \"broken_at\": null,\n    \"confirmed_steps\": 1,\n    \"error", "authority_tier": "engine_derived", "source": "Narrow Highway engine — sealed record", "readable": false, "generated": false}, {"id": "card_seal_d6ea2330ea0194468005fe1e484e53794b1c10075ede042dabbb75feee04b9e1", "title": "Receipt d6ea2330ea01… — sealed: record", "shelf": "seals", "surface": "secular", "snippet": "{\n \"anchors\": [],\n \"axis_coords\": {\n  \"axis\": \"mathematics\",\n  \"dimensions\": [\n   \"reasoning\"\n  ]\n },\n \"gate_results\": [\n  {\n   \"details\": {\n    \"broken_at\": null,\n    \"confirmed_steps\": 1,\n    \"error", "authority_tier": "engine_derived", "source": "Narrow Highway engine — sealed record", "readable": false, "generated": false}], "house": {"door": "FIND", "kind": "cards", "trail": "results", "seal": null, "next_step": {"do": "open the top card", "door": "FIND", "tool": "card_get", "params": {"id": "card_crypto_public_key"}}, "ends": "a verdict or a card · the trail · a seal · one next step"}}