Post-quantum cryptography: Supersingular isogenies for beginners webinar

This post has been republished via RSS; it originally appeared at: Microsoft Research.

A large-scale quantum computer would break the public key cryptography that is currently used to secure the internet. While scientists around the world are in a race to build quantum computers, cryptographers are frantically working to reinvent encryption in order to secure our digital world before that day comes.

In this webinar led by Microsoft researcher Dr. Craig Costello, you will examine why post-quantum cryptography is so critical as we move closer to realizing quantum computing, and you will learn the basics of supersingular isogeny Diffie-Hellman (SIDH), which is one of the popular candidates for post-quantum key exchange. The best known classical and quantum algorithms for attacking the SIDH protocol have exponential runtimes, which is why SIDH has the lowest bandwidth requirements of all the post-quantum encryption candidates currently under scrutiny.

Together, you’ll explore:

  • The motivation for post-quantum cryptography
  • Foundational theory of elliptic curves and isogenies
  • A step-by-step example of the SIDH protocol
  • Where to find open source software for post-quantum cryptography

Dr. Craig Costello is a Senior Researcher in the Security and Cryptography group at Microsoft Research. His primary interests are in elliptic curve cryptography and in post-quantum cryptography based on isogenies. Prior to joining Microsoft Research, he was a post-doctoral scholar at Eindhoven University of Technology in the Netherlands, a Fulbright scholar at the University of California, Irvine, and a PhD candidate at the Queensland University of Technology in Australia.

The post Post-quantum cryptography: Supersingular isogenies for beginners webinar appeared first on Microsoft Research.

Leave a Reply

Your email address will not be published. Required fields are marked *

*

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