Cryptography

Researchers have proved that secure quantum encryption is possible in a world without hard problems.

Researchers have shown how to find the simplest description of a data set faster than by simply checking every possibility.

The prolific researcher found deep connections between randomness and computation and spent a career influencing cryptographers, complexity researchers and more.

Russell Impagliazzo studies hard problems, the limits of cryptography, the nature of randomness and more.

Artificial intelligence learned how to generate text and art better than ever before, while computer scientists developed algorithms that solved long-standing problems.

Two researchers have improved a well-known technique for lattice basis reduction, opening up new avenues for practical experiments in cryptography and mathematics.

Three researchers have found a long-sought way to pull information from large databases secretly, moving us closer to fully private internet searches.

Shor’s algorithm will enable future quantum computers to factor large numbers quickly, undermining many online security protocols. Now a researcher has shown how to do it even faster.

How hard is it to prove that problems are hard to solve? Meta-complexity theorists have been asking questions like this for decades. A string of recent results has started to deliver answers.