Skip to content
sahil.science
Questions
Papers
Topics
Syntheses
Almanac
About
C⁶
2026
← Questions
Source-derived question
What real-world fields, like cryptography, would be affected if someone proved P equals NP?
Computational Complexity Theory
Cryptography
Sources that address it
ACM A.M. Turing Award
almanac
Related questions
How did Manuel Blum help define what it means for an encryption scheme to be secure?
How does complexity theory explain why cryptographers trust certain codes to be practically unbreakable?
What is a pseudorandom number generator, and why does modern cryptography depend on it?
Why did pre-1984 cryptography rely on computational hardness rather than physical laws for its security guarantees?
How can a nondeterministic finite automaton be converted into a deterministic one without losing expressive power?
How did Colossus use vacuum tubes and electronic logic to process paper tape faster than earlier electromechanical machines?
How did Cook's proof show that many seemingly unrelated hard computational problems were secretly versions of the same problem?
How did Liskov's work on Byzantine fault tolerance shape how large distributed systems handle failure?