How Unknowable Math Can Help Hide Secrets
SMRTR summary
Mathematical unknowability — the idea that some problems can never be solved — turns out to have real-world applications in cybersecurity. Building on Kurt Gödel's 1931 incompleteness theorems, which proved that some mathematical truths can never be proven, researchers are now using similar "undecidable" problems as the foundation for encryption, making certain secrets theoretically impossible to crack.
SMRTR provides this summary for quick context. The original article belongs to Quanta Magazine.
Read the original article