causal
False Riemann hypothesis would break prime cryptography
If the Riemann hypothesis were proven false, it would be a serious blow to the random model of the primes, implying a secret hidden pattern; since one unknown pattern probably implies more, and patterns can lead to cryptographic exploits, mathematicians would rapidly abandon prime-based cryptography.
causalpending
Speaker
Terence TaoEvidence Quote
“I think we would very rapidly abandon any cryptography based on the primes, because if there was one pattern that we didn't know about, there are probably more, and these patterns can lead to exploits in crypto.”
Source
Dwarkesh Patel Podcast - Terence Tao – Kepler, Newton, and the true nature of mathematical discovery— Dwarkesh Patel PodcastCreated: 6/13/2026, 3:32:24 AM
Your notes
Loading notes...