Cryptography

A graduate student recently harnessed the complexity of mathematical proofs to create a powerful new tool in cryptography.

Some quantum cryptographers want to find ways to keep messages secret even if the rules of quantum mechanics don’t hold. The recently rediscovered idea of quantum jamming complicates things.

Two research groups say they have significantly reduced the amount of qubits and time required to crack common online security technologies.

Charles Bennett and Gilles Brassard were recognized for their foundational work in quantum information science.

Henry Yuen is developing a new mathematical language to describe problems whose inputs and outputs aren’t ordinary numbers.

Large language models such as ChatGPT come with filters to keep certain info from getting out. A new mathematical argument shows that systems like this can never be completely safe.

In theory, quantum physics can bypass the hard mathematical problems at the root of modern encryption. A new proof shows how.

Randomness is essential to some research, but it’s always been prohibitively complicated. Now, we can use “pseudorandomness” instead.

It’s been difficult to find important questions that quantum computers can answer faster than classical machines, but a new algorithm appears to do it for some critical optimization tasks.