Skip to content
Quantum-Safe Algorithms Face Off in NIST’s Cryptography Showdown episode artwork

EPISODE · Aug 23, 2022 · 19 MIN

Quantum-Safe Algorithms Face Off in NIST’s Cryptography Showdown

from Relatively Certain · host JQI Podcast Editor

While browsing the web, you might not realize that the security of your online transactions is guaranteed by a hard-to-crack math problem called factoring. But this security could evaporate in an instant—if a big enough quantum computer is built. Computers that store information in quantum hardware—like individual ions, atoms or photons—would make quick work of the factoring problem and threaten the safety of current protocols. To thwart the threat posed by possible quantum computers, the National Institute of Standards and Technology (NIST) has been running a kind of competition.

Episode metadata supplied by the publisher feed · Published Aug 23, 2022

Embed this episode

Ready to play

Quantum-Safe Algorithms Face Off in NIST’s Cryptography Showdown

0:00 19:36

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

Frequently Asked Questions

How long is this episode of Relatively Certain?

This episode is 19 minutes long.

When was this Relatively Certain episode published?

This episode was published on August 23, 2022.

Can I download this Relatively Certain episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!