One-Way Functions and TrapdoorsAll of modern crypto rests on an unproven assumption. Why P != NP would still not be enough to secure anything.
The Exponential Time Hypothesis and Fine-Grained ComplexityBeyond P vs NP: why your O(n^2) string algorithm is probably optimal too.