Posted by on
Tags: , , , , , , , , , , ,
Categories: Uncategorized

Although the potential for quantum computing was first posited in 1982 by physicist Richard Feynman, and the MIT mathematician Peter Shor reported an algorithm that would enable quantum computers to defeat most types of cryptography in common use in 1994, it’s long been assumed practical quantum computing was out of reach for the foreseeable future.

But the days of kicking the potential for quantum computers’ cryptography threat down the road may soon be at an end, according to Tim Hollebeek, industry and standards technical strategist at DigiCert Inc., a digital security company headquartered in Lehi, Utah. Cryptographically relevant quantum computers capable of solving the type of problems that enable classical cryptography are around the corner as quantum computers keep getting better.

Find out about the latest developments that will enable quantum computers to defeat classical encryption, and what organizations using encryption can do to prepare.

Check out the full interview here:

Leave a Reply

This site uses Akismet to reduce spam. Learn how your comment data is processed.