Cryptography

Two researchers have broken an encryption protocol that many saw as a promising defense against the power of quantum computing.

Cryptographers want to know which of five possible worlds we inhabit, which will reveal whether truly secure cryptography is even possible.

The existence of secure cryptography depends on one of the oldest questions in computational complexity.

For the first time, experiments demonstrate the possibility of sharing secrets with perfect privacy — even when the devices used to share them cannot be trusted.

A cryptographic master tool called indistinguishability obfuscation has for years seemed too good to be true. Three researchers have figured out that it can work.

Ronald Rivest helped come up with the RSA algorithm, which safeguards online commerce. Now he’s hoping to make democratic elections more trustworthy.

Researchers have just released hacker-proof cryptographic code — programs with the same level of invincibility as a mathematical proof.

Digital security depends on the difficulty of factoring large numbers. A new proof shows why one method for breaking digital encryption won’t work.

Urmila Mahadev spent eight years in graduate school solving one of the most basic questions in quantum computation: How do you know whether a quantum computer has done anything quantum at all?