quantum cryptography

What will quantum computers be able to do that ordinary computers can't do?

What's stopping us from building useful quantum computers? And how long until we'll have them?

Researchers from the University of Maryland have devised a new kind of random number generator that is cryptographically secure, inherently private and — most importantly — certified random by the laws of physics. Randomness is important, particularly in the age of the Internet, because it guarantees security. Valuable data and messages can be encrypted using long strings of random numbers to act as "keys", which encode and decode the information. Randomness implies unpredictability, so if the key is truly random, it's next to impossible for an outsider to guess it.

In the second of two articles, Artur Ekert visits the strange subatomic world and investigates the possibility of unbreakable quantum cryptography.
  • Want facts and want them fast? Our Maths in a minute series explores key mathematical concepts in just a few words.

  • As COP28, the 2023 United Nations Climate Change Conference, kicks off we look at how maths can help understand the climate crisis.

  • How do you create dramatic film out of mathematics? We find out with writer and director Timothy Lanzone.

  • Mathematics plays a central role in understanding how infectious diseases spread. This collection of articles looks at some basic concepts in epidemiology to help you understand this fascinating and important field, and set you up for further study.

  • Find out why the formula we use to work out conditional probabilities is true!

  • We talk about a play that explores the fascinating mathematical collaboration between the mathematicians GH Hardy and Srinivasa Ramanujan.