A card from a free library — ask anything, no account, works offline. Every card carries its source.

Cryptography — public keys and hard problems

cryptography

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 one-time pad has perfect secrecy. Four pillars rest on the instruments (number theory, information), the P vs NP region (hardness), and Riemann (the primes). The applied domain where the Millennium problems become a daily tool - every secure connection bets factoring is hard. The stick (stick_cryptography_public_keys_and_hard_problems) seals the RSA round-trip and Fermat's little theorem (tools/seed_cryptography.py).

source

Narrow Highway — cryptography · stick_cryptography_public_keys_and_hard_problems

card id

card_floor_cryptography

address

WIT.codex.EXP/cryptography-public-keys-and-hard-problems/REF.WITNESSED@narrow-highway

related in the keeping ↗ · raw JSON ↗

adjoining cards

has part → Public-key cryptography — RSA — a pillar of cryptography (Public-key cryptography)
has part → Hardness — security is a hard problem — a pillar of cryptography (Hardness)
has part → Perfect secrecy — the one-time pad — a pillar of cryptography (Perfect secrecy)
has part → Primes — the raw material — a pillar of cryptography (Primes)
part of → The Floor of Discovery — one floor, and by its design the fear of God — secrecy on the one map

Is this card incomplete? Tell the library — it will call out for more ↗