Crypto hardness conjectures are phrased in sharp cycle counts

geoffreyirving · x · 2026-11-21

Continuing his thread on Riemann vs P≠NP, geoffreyirving points out that in cryptography all hardness conjectures are phrased in terms of sharp cycle counts, e.g. "one can't find SHA-256 collisions in under 2^128 cycles."

Related event: DeepMind researcher asks what comes after Riemann — number theorists have no answer(8 posts)→

Original post →

More from Research

Research channel →