A card from a free library — ask anything, no account, works offline. Every card carries its source.
Hardness — security is a hard problem
cryptography
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 vs NP region.
source
Narrow Highway — cryptography
card id
card_crypto_hardness
address
WIT.codex.FCT/hardness-security-is-a-hard-problem/REF.WITNESSED@narrow-highway
adjoining cards
- part of → Cryptography — public keys and hard problems — a pillar of cryptography (Hardness)
- connects at → The P versus NP chain - from the machine and the circuit to the three barriers — RSA's security is the belief that factoring is hard - a P vs NP hardness assumption
Is this card incomplete? Tell the library — it will call out for more ↗