Researchers Identify ‘Master Problem’ Underlying All Cryptography | Quanta Magazine
The existence of secure cryptography depends on one of the oldest questions in computational complexity.
Hasnain says:
“The paper has set off a cascade of new research at the interface of cryptography and complexity theory. While both disciplines investigate how hard computational problems are, they come at the question from different mindsets, said Rahul Santhanam, a complexity theorist at the University of Oxford. Cryptography, he said, is fast-moving, pragmatic and optimistic, while complexity theory is slow-moving and conservative. In the latter field, “there are these long-standing open questions, and once in every dozen years, something happens,” he said. But “the questions are very deep and difficult.””
Posted on 2022-04-07T04:17:27+0000